Evaluating heuristic scheduling algorithms for high performance parallel processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2858, Issue , 2003, Pages 160-173

  Lundberg, Lars ^a   Broberg, Magnus ^a   Klonowska, Kamilla ^a  

^a BLEKINGE INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTER COMPUTING; HEURISTIC ALGORITHMS; SCHEDULING ALGORITHMS;

CLUSTER SYSTEMS; COMPLETION TIME; HARDWARE PLATFORM; HEURISTIC SCHEDULING ALGORITHMS; HEURISTIC SEARCH; HIGH PERFORMANCE COMPUTING; PARALLEL PROCESSING; UPPER BOUND;

OPTIMIZATION;

EID: 0242339532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39707-6_12     Document Type: Review

References (14)

1. J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer-Verlag, ISBN 3-540-61496-6, 1996.
2. M. Broberg, L. Lundberg, and H. Grahn, Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads, in Proc. of the 13th International Parallel Processing Symposium, pp. 407-413, 1999.
3. M. Broberg, L. Lundberg, and H. Grahn, VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs, in Proceedings of the 12th International Parallel Processing Symposium, pp. 770-776, 1998.
4. S. H. Bokhari, Partitioning Problems in Parallel, Pipelined, and Distributed Computing, IEEE Transactions on Computers, Vol. 37, No. 1, 1988.
5. M. Garey and D. Johnson, Computers and Intractability, W. H. Freeman and Company, 1979.
6. E. Hagersten, and M. Koster, WildFire: A Scalable Path for SMPs, in Proc. of the Fifth International Symposium on High Performance Computer Architecture, pp. 172-181, 1999.
7. S. Kleiman, D. Shah, and B. Smaalders, Programming with threads, Prentice Hall, 1996.
8. J. Laudon and D. Lenoski, The SGI Origin: A ccNUMA Highly Scalable Server, in Proc. of the 24th Annual International Symposium on Computer Architecture (ISCA), pp. 241-251, 1997.
9. H. Lennerstad and L. Lundberg, An optimal Execution Time Estimate of Static versus Dynamic Allocation in Multiprocessor Systems, SIAM Journal of Computing, Vol. 24, No. 4, pp. 751-764, 1995.
10. H. Lennerstad and L. Lundberg, Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems, SIAM Journal of Computing, Vol. 29, No. 6, pp. 1816-1838, 2000.
11. H. Lennerstad and L. Lundberg, Optimal Worst Case Formulas Comparing Cache Memory Associativity, SIAM Journal of Computing, Vol. 30, No. 3, pp. 872-905, 2000.
12. T. Lovett and R. Clapp, STiNG: A cc-NUMA Computer System for the Commercial Marketplace, in Proc. of the 23rd Annual International Symposium on Computer Architecture (ISCA), pp. 308-317, 1996.
13. L. Lundberg, H. Lennerstad, Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 4, pp. 346-358, 1998.
14. L. Lundberg, H. Lennerstad, An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing, in Proc. of the 1994 ACM International Conference on Supercomputing, pp. 196-203, 1994.