P. Fatourou and P. Spirakis. Scheduling algorithms for strict multithreaded computations. In ISAAC: 7th International Symposium on Algorithms and Computation, number 1178 in LNCS, pages 407--416, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
....from the dilemma that subtrees which are not subdivided turn out to be too large for proper load balancing whereas excessive communication is necessary if the tree is shredded into too many pieces. We consider random polling dynamic load balancing [19] also known as randomized work stealing [5, 10, 2, 11]) a simple algorithm that avoids both problems: Every processing element (PE) handles at most one piece of work (which may represent a part of a backtracking tree) at any point in time. If a PE runs out of work, it sends requests to randomly chosen PEs until a busy one is found which splits its ....
P. Fatourou and P. Spirakis. Scheduling algorithms for strict multithreaded computations. In ISAAC: 7th International Symposium on Algorithms and Computation, number 1178 in LNCS, pages 407--416, 1996.
The Natural Work-Stealing Algorithm is Stable - Berenbrink, Friedetzky, Goldberg (2001) (3 citations) (Correct)
....O(T 1 =P T1 ) where T 1 denotes the minimum sequential execution time of the multi threaded computation, and T1 denotes the minimum execution time with an infinite number of processors. Furthermore, they estimate the probability that the execution time is increased by an additional factor. In [FS96] Fatourou and Spirakis develop an algorithm for k strict multi threaded computations. In this case, all data dependencies of a thread are directed to ancestors in at most k higher levels. 2 The Work Stealing Process Suppose that we have n processors and n generators , which create work for ....
Panagiota Fatourou and Paul Spirakis. Scheduling algorithms for strict multithreaded computations. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'96), pages 407--416, 1996.
The MOL Project: An Open, Extensible Metacomputer - Reinefeld, Baraglia.. (1997) (16 citations) (Correct)
....thread objects, provide an easy and intuitive way to model multithreaded computations as done in CILK [10] In this computational model, threads may send messages (results) to their parents. With later versions it will be possible to send data across more than one generation (e.g. to grandparents) [21]. In the current VDS release, we implemented a workstealing method [11] for thread objects as well as diffusive load balancing for normal and weighted objects. Shared Memory Simulation with DIVA. The distributed variables library DIVA provides functions for simulating shared memory on distributed ....
P. Fatourou, P. Spirakis. Scheduling Algorithms for Strict Multithreaded Computations. Proc. of the 7th Annual International Symposium on Algorithms and Computation (ISAAC '96), 1996, to appear.
A New Scheduling Algorithm for General Strict Multithreaded .. - Fatourou, Spirakis (1999) (1 citation) Self-citation (Fatourou Spirakis) (Correct)
....processors steal work from other processors. The work stealing paradigm dates back at least as far as Burton and Sleep s research [11] on parallel execution of functional programs and Halstead s implementation of Multilisp [18] Since then a lot of work has been done in this direction (see e.g. [1, 4, 5, 6, 7, 8, 15]) Three significant performance parameters of any scheduling algorithm for multithreaded computations are the required space, their execution time and the communication cost incurred by them. The execution time is the total time needed by the algorithm to execute the instructions of all threads ....
....only for shared memory machines and do not account for communication cost. On the opposite, our analysis holds even for distributed memory machines; more significantly, we provide bounds on the communication complexity of our algorithm for such machines. Fatourou and Spirakis considered in [15] the case of k strict conputations, that is, computations on which any dependency from a thread goes to some of the k ancestors of the thread in the activation tree. They present two scheduling algorithms for k strict multithreaded computations. Their algorithms work in a different way than the ....
[Article contains additional citation context not shown here]
P. Fatourou and P. Spirakis, "Scheduling Algorithms for Strict Multithreaded Computations," Proceedings of the 10th Internbational Sumposium on Algorithms and Computation, pp. 407--416, Osaka, Japan, 1996. i
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC