Allocating Independent Subtasks on Parallel Processors
IEEE Transactions on Software Engineering
Guided self-scheduling: A practical scheduling scheme for parallel supercomputers
IEEE Transactions on Computers
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
Dynamic Processor Self-Scheduling for General Parallel Nested Loops
IEEE Transactions on Computers
Factoring: a method for scheduling parallel loops
Communications of the ACM
A dynamic scheduling method for irregular parallel programs
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Safe self-scheduling: a parallel loop scheduling scheme for shared-memory multiprocessors
International Journal of Parallel Programming
Adaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems
IEEE Transactions on Parallel and Distributed Systems
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Affinity scheduling of unbalanced workloads
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Trapezoid Self-Scheduling: A Practical Scheduling Scheme for Parallel Compilers
IEEE Transactions on Parallel and Distributed Systems
Using Processor Affinity in Loop Scheduling on Shared-Memory Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
In this paper we present an analysis on a shared memory system of five self-scheduling algorithms running on top of the threads programming model to schedule the loop with cross-iteration dependence. Four of them are well-known: self-scheduling (SS), chunked self-scheduling (CSS), guided self-scheduling (GSS) and factoring. Because these schemes are all for loops without cross-iteration dependence, we study the modification of these schemes to schedule the loop with cross-iteration dependence. The fifth is our proposal: carried-dependence self-scheduling (CDSS). The experiments conducted in varying parameters clearly show that CDSS outperforms other modified self-scheduling approaches in a number of simulations. CDSS, modified SS, factoring, GSS and CSS are executed efficiently in order of execution time.