A simple algorithm for the generation of efficient loop structures
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
On Customizing the UML for Modeling Performance-Oriented Applications
UML '02 Proceedings of the 5th International Conference on The Unified Modeling Language
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Dynamic Service Composition in Pervasive Computing
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Enabling workflows in GridSolve: request sequencing and service trading
The Journal of Supercomputing
Extending Amdahl's law and Gustafson's law by evaluating interconnections on multi-core processors
The Journal of Supercomputing
| Hi-index | 0.00 |
Presents a model of par References Cited: 24 allel computation, the parameterized task graph, which is a compact, problem-size-independent representation of some frequently-used directed acylic task graphs. Techniques for automating the construction of such a representation, starting from an annotated sequential program, are proposed. We show how to represent the computational load for each node and the communication volume for each edge in a problem-size-independent way. Lastly, we describe related work and techniques required in order to generate local data structures, computation code and communication code.