Compile-time partitioning and scheduling of parallel programs
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Concurrent Prolog: A Progress Report
Computer
Communicating sequential processes
Communications of the ACM
Parallel processing: a smart compiler and a dumb machine
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
The architecture of concurrent programs
The architecture of concurrent programs
Dependence graphs and compiler optimizations
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
B - HIVE: a heterogeneous, interconnected, versatile and expandable multicomputer system
ACM SIGARCH Computer Architecture News
CEDAR: a large scale multiprocessor
ACM SIGARCH Computer Architecture News
Task assignment in distributed systems
Task assignment in distributed systems
Towards automated design of multicomputer system for real-time applications (architecture, task division)
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Optimizing the use of static buffers for DMA on a CELL chip
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
Hi-index | 0.01 |
A new medium grain model is proposed to model accurately the movement of data between various computational tasks of a user program to run on a parallel machine. Three different attributes are used to represent the communication activities that might exist among various tasks. a. Time taken to produce an outgoing data package for a dependent task. b. Dependent task execution duration without the arrival of the incoming data package. c. The communication time to send data package from one task to its dependent task. These parameters help in identifying possible computational overlap between interactive tasks, which leads to additional speedup besides the usual speedup that could be achieved from parallel execution of independent tasks, communication activities that might exist among various tasks. These parameters help in identifying possible computational overlap between interactive tasks, which leads to additional speedup besides the usual speedup that could be achieved from parallel execution of independent tasks.