Title :
The Benevolent Bandit Laboratory: a testbed for distributed algorithms
Author :
Felderman, Robert E. ; Schooler, Eve M. ; Kleinrock, Leonard
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fDate :
2/1/1989 12:00:00 AM
Abstract :
The design, implementation, and use of a distributed processing environment on a network of IBM PCs running DOS is described. Temporarily unused PCs can be accessed by other users on the network to perform distributed computations. An owner of a PC need not be aware that the machine is being used during idle times; the machine is immediately returned when the owner begins to work again. Some degree of computation resiliency is provided in this unreliable environment; if a PC is part of a distributed algorithm and is reclaimed by its owner, the system finds a replacement node (if possible), resends the affected code to the processor, and restarts it. Thus, a distributed computation is able to proceed despite a set of transient processors. System performance, distributed applications, and fault tolerance are discussed. Performance improvements are demonstrated by applications like parallel merge sort and a distributed search solution to the eight puzzle
Keywords :
computer networks; distributed processing; microcomputer applications; Benevolent Bandit Laboratory; DOS; IBM PC network; computation resiliency; distributed algorithms; distributed processing; fault tolerance; personal computers; replacement node; system performance; testbed; Computer networks; Computer science; Distributed algorithms; Distributed computing; Laboratories; Local area networks; Microcomputers; System performance; Testing; Time sharing computer systems;
Journal_Title :
Selected Areas in Communications, IEEE Journal on