List scheduling of general task graphs under LogP
- 1 July 2000
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 26 (9) , 1109-1128
- https://doi.org/10.1016/s0167-8191(00)00031-4
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Some Results On Scheduling Flat Trees In LogP ModelINFOR: Information Systems and Operational Research, 1999
- Assessing LogP model parameters for the IBM-SPPublished by Springer Nature ,1998
- Can shared-memory model serve as a bridging model for parallel computation?Published by Association for Computing Machinery (ACM) ,1997
- LogPCommunications of the ACM, 1996
- Assessing fast network interfacesIEEE Micro, 1996
- Parallax: a tool for parallel program schedulingIEEE Parallel & Distributed Technology: Systems & Applications, 1993
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961