The Community for Technology Leaders
Green Image
<p>A method that combines global load balancing with dynamic task scheduling on a multiprocessor machine is presented. This method does not require prior knowledge of the run times of tasks, and is based on a rough grammar representing distributed computation is presented. Production rules are dynamically constructed when a concurrent program is run. The set of the rough grammar production rules is updated and rolled in a pipeline fashion, together with codes of the processes. This pipeline fashion of rolling the jobs defines the global job balancing. The rough grammar uses any operators and metrics, not only concatenation, inside its production rules. Performance parameters for the combination of a global load balancing and decentralized dynamic task scheduling are derived and compared with those for a statically scheduled multiprocessor. Based on these parameters, the decentralized methodology is shown to attain a much higher performance level and a highly improved fault tolerance.</p>
fault-tolerant computing; global load balancing; dynamic task scheduling; multiprocessor machine; rough grammar; distributed computation; concurrent program; rough grammar production rules; pipeline fashion; statically scheduled multiprocessor; decentralized methodology; fault tolerance; fault tolerant computing; grammars; parallel processing; pipeline processing; scheduling

Z. Wojcik and B. Wojcik, "Rough Grammar for Efficient and Fault-Tolerant Computing on a Distributed System," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 652-668, 1991.
87 ms
(Ver 3.3 (11022016))