A bridging model for parallel computation
Communications of the ACM
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
Optimal Scheduling Algorithm for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
A Task Scheduling Algorithm to Package Messages on Distributed Memory Parallel Machines
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
NP-Completeness of the Bulk Synchronous Task Scheduling Problem and Its Approximation Algorithm
ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
Static task scheduling and grain packing in parallel processing systems
Static task scheduling and grain packing in parallel processing systems
| Hi-index | 0.00 |
The mainstream architecture of a parallel machine with more than tens of processors is a distributed-memory machine. The bulk synchronous task scheduling problem (BSSP, for short) is an task scheduling problem for distributed-memory machines. This paper shows that there does not exist a 驴-approximation algorithm to solve the optimization counterpart of BSSP for any 驴 P = NP.