Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0914.68011
Bła\D{z}ewicz, Jacek; Drozdowski, Maciej; Markiewicz, Mariusz
Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems. (English)
[J] Parallel Comput. 25, No.1, 87-98 (1999). ISSN 0167-8191

Summary: In this work the idea of a divisible task is presented. The divisible task is a computation which can be divided with arbitrary granularity into independent parts solved in parallel by distributed computers. A simple model of a communication delay and a computation time is adopted, based on which various computer architectures and communication methods are analyzed. We review the ways of applying the divisible task concept in the case of a linear array, star, bus, hypercube, and mesh of processors. Then, the results of an empirical justification of the analysis are presented.

MSC 2000:: *68M20 Performance evaluation of computer systems, etc.

Keywords: deterministic scheduling; divisible tasks; distributed processing; communication delays

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]