Andrei Radulescu, Arjan J.C. van Gemund  Home/Search
Context Related
| ce.et.tudelft.nl/~and...ICPP2001.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ce.et.tudelft.nl/~andrei...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A relatively new trend in parallel programming scheduling is the so-called mixed task and data scheduling. It has been shown that mixing task and data parallelism to solve large computational applications often yields better speedups compared to either applying pure task parallelism or pure data parallelism. In this paper we present a new compile-time heuristic, named Critical Path and Allocation (CPA), for scheduling data-parallel task graphs. Designed to have a very low cost, its complexity... (Update)
Similar documents based on text: More All
1.8: CPR: Mixed Task and Data Parallel Scheduling for.. - Radulescu.. (2001) (Correct)
0.5: On the Complexity of List Scheduling Algorithms for.. - Radulescu, van Gemund (1999) (Correct)
0.4: FLB: Fast Load Balancing for Distributed-Memory Machines - Radulescu, van Gemund (1999) (Correct)
BibTeX entry: (Update)
Andrei Radulescu and Arjan van Gemund. A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling. In Proceedings of the 15th International Conference on Parallel Processing (ICPP), Valencia, Spain, September 2001. http://citeseer.ist.psu.edu/radulescu01lowcost.html More
@misc{ radulescu01lowcost,
author = "A. Radulescu and A. van Gemund",
title = "A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling",
text = "Andrei Radulescu and Arjan van Gemund. A Low-Cost Approach towards Mixed
Task and Data Parallel Scheduling. In Proceedings of the 15th International
Conference on Parallel Processing (ICPP), Valencia, Spain, September 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/radulescu01lowcost.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
353 Software pipelining: An effective scheduling technique for V.. (context) - Lam - 1988
294 High Performance Compilers for Parallel Computing (context) - Wolfe - 1995
247 Partitioning and Scheduling Parallel Programs for Execution .. (context) - Sarkar - 1989
96 A language for modular parallel programming (context) - Foster, Chandy - 1995
93 DSC: Scheduling parallel tasks on an unbounded number of pro.. - Yang, Gerasoulis - 1994
93 Static rate-optimal scheduling of iterative dataflow program.. (context) - Parhi, Messerschmitt - 1991
90 Optimal loop parallelization (context) - Aiken, Nicolau - 1988
81 Hypertool: A programming aid for message-passing systems - Wu, Gajski - 1990
73 Exploiting task and data parallelism on a multicomputer - Subhlok, Stichnoth et al. - 1993
55 Baltimore: Johns Hopkins University Press (context) - Golub, van Loan - 1996
55 Constructive methods for scheduling uniform loop nests - Darte, Robert - 1994
54 Approximate algorithms for scheduling parallelizable tasks (context) - Turek, Wolf et al. - 1992
47 Panda: A portable platform to support parallel programming l.. - Bhoedjang, Ruhl et al. - 1993
40 Iterative modulo scheduling (context) - Rau - 1996
[Article contains additional citations not shown here]
Documents on the same site (http://ce.et.tudelft.nl/~andrei/professional/papers.html):
CPR: Mixed Task and Data Parallel Scheduling for.. - Radulescu.. (2001) (Correct)
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