High-performance computer architecture
High-performance computer architecture
Grain determination for parallel processing systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Introduction to Parallel & Vector Solution of Linear Systems
Introduction to Parallel & Vector Solution of Linear Systems
Automatic determination of grain size for efficient parallel processing
Communications of the ACM - Special issue: multiprocessing
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Parallel Programming and Compilers
Parallel Programming and Compilers
A General Approach to Multiprocessor Scheduling
A General Approach to Multiprocessor Scheduling
Lu decomposition on a multiprocessing system with communications delay
Lu decomposition on a multiprocessing system with communications delay
Automatic transformation of FORTRAN loops to reduce cache conflicts
ICS '91 Proceedings of the 5th international conference on Supercomputing
A fast static scheduling algorithm for DAGs on an unbounded number of processors
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments
IEEE Transactions on Parallel and Distributed Systems
Declustering: A New Multiprocessor Scheduling Technique
IEEE Transactions on Parallel and Distributed Systems
Scheduling Task In-Trees on Distributed Memory Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Task scheduling in distributed computing systems with a genetic algorithm
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Decentralizing execution of composite web services
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A Hybrid Analysis of an Optimization Approach for Cluster Applications
The Journal of Supercomputing
Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
| Hi-index | 0.00 |
Clustering is a mapping of the nodes of a task graph onto labeled clusters. We present a unified framework for clustering of directed acyclic graphs (DAGs). Several clustering algorithms from the literature are compared using this framework. For coarse grain DAGs two interesting properties are presented. For every nonlinear clustering there exists a linear clustering whose parallel time is less than the nonlinear one. Furthermore, the parallel time of any linear clustering is within a factor of two of the optimal. Two clustering algorithms are presented with near linear time complexity for coarse grain DAGs. The conclusion is that linear clustering is an efficient and accurate operation.