Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
Software implementation of a recursive fault tolerance algorithm on a network of computers
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Multiprocessor tree-search experiments
Advances in computer chess
Location Independent Remote Execution in NEST
IEEE Transactions on Software Engineering
The Crystal Multicomputer: Design and Implementation Experience
IEEE Transactions on Software Engineering
Using idle workstations in a shared computing environment
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
The “worm” programs—early experience with a distributed computation
Communications of the ACM
Overview of the Jasmin database machine
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
The Roscoe distributed operating system
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
The design and performance of high-level language primitives for distributed programming
The design and performance of high-level language primitives for distributed programming
Algorithm partitioning tools for a high-performance multiprocessor
Algorithm partitioning tools for a high-performance multiprocessor
Techniques for the design of parallel and pipelined vlsi systems for numerical computation with special reference to signal processing applications (systolic array, scheduling)
Scheduling pipelined communication in distributed memory multiprocessors for real-time applications
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
SOS: synthesis of application-specific heterogeneous multiprocessor systems
Readings in hardware/software co-design
Optimal Scheduling Algorithms for Communication Constrained Parallel Processing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Comment on "A Novel Data Distribution Technique for Host-Client Type Parallel Applications'
IEEE Transactions on Parallel and Distributed Systems
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems
IEEE Transactions on Parallel and Distributed Systems
Experimental study of scheduling with memory constraints using hybrid methods
Journal of Computational and Applied Mathematics
Heuristics for multi-round divisible loads scheduling with limited memory
Parallel Computing
Performance-based data distribution for data mining applications on grid computing environments
The Journal of Supercomputing
Fully polynomial time approximation schemes for scheduling divisible loads
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Energy considerations for divisible load processing
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Scheduling divisible MapReduce computations
Journal of Parallel and Distributed Computing
A generalized linear programming based approach to optimal divisible load scheduling
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.98 |
A model is presented for parallel processing in loosely coupled multiprocessing environments, such as networks of computer workstations, that are amenable to large-grained parallelism. The model takes into account the overhead involved in data communication to and from a remote processor and can be used to partition a large class of computations optimally, consisting of computations that can be organized as a one-level tree and are homogeneous and separable. The optimal partition can be determined for a given number processors, and, if required, the optimal number of processors to use can also be derived. Experimental results validate the model and demonstrate its effectiveness.