VLSI array processors
High-performance computer architecture
High-performance computer architecture
Gaussian elimination on hypercubes
Proceedings of the international workshop on Parallel algorithms & architectures
Parallel solution of triangular systems on distributed-memory multiprocessors
SIAM Journal on Scientific and Statistical Computing
Introduction to Parallel & Vector Solution of Linear Systems
Introduction to Parallel & Vector Solution of Linear Systems
Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
Information Processing Letters
Automatic determination of grain size for efficient parallel processing
Communications of the ACM - Special issue: multiprocessing
Scheduling with sufficient loosely coupled processors
Journal of Parallel and Distributed Computing
A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
A fast static scheduling algorithm for DAGs on an unbounded number of processors
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Grain Size Determination for Parallel Processing
IEEE Software
Upper time bounds for executing PRAM-programs on the LogP-machine
ICS '95 Proceedings of the 9th international conference on Supercomputing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
Multi-dimensional resource scheduling for parallel queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Perils and pitfalls of parallel discrete-event simulation
WSC '96 Proceedings of the 28th conference on Winter simulation
Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures
IEEE Transactions on Parallel and Distributed Systems
How “hard” is thread partitioning and how “bad” is a list scheduling based partitioning algorithm?
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs
IEEE Transactions on Parallel and Distributed Systems
Analysis of a Heuristic for Code Partitioning
The Journal of Supercomputing
Task Spreading and Shrinking on Multiprocessor Systems and Networks of Workstations
IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Task Allocation on a Network of Processors
IEEE Transactions on Computers
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks
IEEE Transactions on Parallel and Distributed Systems
Sparse LU factorization with partial pivoting on distributed memory machines
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
A compilation method for communication—efficient partitioning of DOALL loops
Compiler optimizations for scalable parallel systems
A duplication based compile time scheduling method for task parallelism
Compiler optimizations for scalable parallel systems
A framework for performance-based program partitioning
Progress in computer research
A framework for performance-based program partitioning
Progress in computer research
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
A Robust Compile Time Method for SchedulingTask Parallelism on Distributed Memory Machines
The Journal of Supercomputing
IEEE Parallel & Distributed Technology: Systems & Technology
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Source Code and Task Graphs in Program Optimization
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A New Clustering Algorithm for Large Communication Delays
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Comparison of General Approaches to Multiprocessor Scheduling
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Dynamic Task Scheduling with Precedence Constraints and Communication Delays
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Optimal Task Scheduling of a Complete K-Ary Tree with Communication Delays
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Genetic Scheduling on Minimal Processing Elements in the Grid
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On Scheduling Task-Graphs to LogP-Machines with Disturbances
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A Run-Time System for Dynamic Grain Packing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A SCOOPP Evaluation on Packing Parallel Objects in Run-Time
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
TOPPER: A Tool for Optimizing the Performance of Parallel Applications
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Scheduling UET grids with unit communication time delays into unbounded/fixed number of processors
Highly parallel computaions
Partial task assignment of task graphs under heterogeneous resource constraints
Proceedings of the 40th annual Design Automation Conference
On finding optimal clusterings of task graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A task duplication scheme for resolving deadlocks in clustered DAGs
Parallel Computing
Compact DAG representation and its symbolic scheduling
Journal of Parallel and Distributed Computing
Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
On unit task linear-nonlinear two-cluster scheduling problem
Proceedings of the 2005 ACM symposium on Applied computing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
The Journal of Supercomputing
Using UML as front-end for heterogeneous software code generation strategies
Proceedings of the conference on Design, automation and test in Europe
Dynamic task allocation strategies in MPSoC for soft real-time applications
Proceedings of the conference on Design, automation and test in Europe
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters
High Performance Computing for Computational Science - VECPAR 2008
CellSs: Scheduling techniques to better exploit memory hierarchy
Scientific Programming - High Performance Computing with the Cell Broadband Engine
Journal of Systems and Software
LATA: a latency and throughput-aware packet processing system
Proceedings of the 47th Design Automation Conference
Lifetime reliability-aware task allocation and scheduling for MPSoC platforms
Proceedings of the Conference on Design, Automation and Test in Europe
Parallel programming with data driven model
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Optimal scheduling for UET-UCT grids into fixed number of processors
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Critical-Task anticipation scheduling algorithm for heterogeneous and grid computing
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Unrolling loops containing task parallelism
LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
A scheduling middleware for data intensive applications on a grid
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Toward better software test estimates and requirement tracking
Journal of Computational Methods in Sciences and Engineering
Hi-index | 0.00 |
The authors consider the impact of the granularity on scheduling task graphs. Schedulingconsists of two parts, the processors assignment of tasks, also called clustering, and theordering of tasks for execution in each processor. The authors introduce two types of clusterings: nonlinear and linear clusterings. A clustering is nonlinear if two parallel tasksare mapped in the same cluster otherwise it is linear. Linear clustering fully exploits thenatural parallelism of a given directed acyclic task graph (DAG) while nonlinear clustering sequentializes independent tasks to reduce parallelism. The authors also introduce a new quantification of the granularity of a DAG and define a coarse grain DAG as the one whose granularity is greater than one. It is proved that every nonlinear clustering of a coarse grain DAG can be transformed into a linear clustering that has less or equal parallel time than the nonlinear one. This result is used to prove the optimality of some important linear clusterings used in parallel numerical computing.