Memory bandwidth aware scheduling for SMP cluster nodes

Proceedings - 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing 2005, PDP 2005

Volumn 2005, Issue , 2005, Pages 187-196

  Koukis, Evangelos ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; PROGRAM PROCESSORS;

MEMORY BANDWIDTH; MULTIPROGRAMMED WORKLOADS; SCHEDULING ALGORITHM; SMP CLUSTER NODES; SYSTEM PROCESSORS;

STORAGE ALLOCATION (COMPUTER);

EID: 33646547611     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2005.26     Document Type: Conference Paper

References (24)

1. D. Agarwal and D. Yeung. Exploiting Application-Level Information to Reduce Memory Bandwidth Consumption. In Proceedings of the 4th Workshop on Complexity-Effective Design, held in conjunction with the 30th International Symposium on Computer Architecture (ISCA-30), Jun 2003.
2. S. F. Altschul, W. Gish, W. Miller, E. W. Meyers, and D. J. Lipman. Basic Local Alignment Search Tool. Journal of Molecular Biology, 215(3):403-410, Oct 1990.
3. C. D. Antonopoulos, D. S. Nikolopoulos, and T. S. Papatheodorou. Scheduling Algorithms with Bus Bandwidth Considerations for SMPs. In Proceedings of the 2003 International Conference on Parallel Processing (ICPP 2003). page 547, Oct 2003.
4. F. Bellosa. Process Cruise Control: Throttling Memory Access in a Soft Real-Time Environment. Technical Report TR-I4-02-97, IMMD IV - Department of Computer Science. University of Erlangen-Nürnberg, Jul 1997.
5. N. J. Boden, D. Cohen, R. E. Felderman, A. E. Kulawik, C. L. Seitz, J. N. Seizovic, and W. Su. Myrinet: A Gigabit-per-Second Local Area Network. IEEE Micro, 15(1):29-36, Feb 1995.
6. D. Burger, J. R. Goodman, and A. Kagi. Memory Bandwidth Limitations of Future Microprocessors. In Proceedings of the 23rd Annual International Symposium on Computer Architecture (ISCA-23). pages 78-89, May 1996.
7. D. G. Feitelson and L. Rudolph. Gang Scheduling Performance Benefits for Fine-Grain Synchronization. Journal of Parallel and Distributed Computing, 16(4): 306-318, Dec 1992.
8. F. Giacomini, T. Amundsen, A. Bogaerts, R. Hauser, B. Johnsen, H. Kohmann, R. Nordstrom, and P. Werner. Low Level SCI software functional specification-Software Infrastructure for SCI. ESPRIT Project 23174. http://www.dolphinics.com/ downloads/ nt/ pdf_zip/SISCI_API-2_1_1.pdf.
9. H. Hellwagner. The SCI Standard and Applications of SCI. In H. Hellwagner and A. Reinefield, editors, Scalable Coherent Interface (SCI): Architecture and Software for High-Performance Computer Clusters, pages 3-34. Springer-Verlag, Sep 1999.
10. J. L. Henning, SPEC CPU2000: Measuring CPU Performance in the New Millennium. Computer, 33(7):28-35, 2000.
11. A. Hori, H. Tezuka, Y. Ishikawa, N. Soda, H. Konaka, and M. Maeda. Implementation of Gang-Scheduling on Workstation Cluster. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 126-139. Springer-Verlag, 1996.
12. M. A. Jette. Performance Characteristics of Gang Scheduling in Multiprogrammed Environments. In Proceedings of the 1998 IEEE/ACM Supercomputing Conference on High Performance Networking and Computing (SC98), San Jose, California, Nov 1997.
13. J. Liedtke, M. Völp, and K. Elphinstone. Preliminary Thoughts on Memory-Bus Scheduling. In Proceedings of the 9th workshop on ACM SIGOPS European workshop, pages 207-210. ACM Press, 2000.
14. J. D. McCalpin. STREAM: Sustainable Memory Bandwidth in High Performance Computers. http://www.cs.virginia.edu/stream/.
15. J. D. McCalpin. Memory Bandwidth and Machine Balance in Current High Performance Computers. IEEE Technical Committee on Computer Architecture (TCCA) Newsletter, Dec 1995.
16. Myricom. GM: A Message-Passing System for Myrinet Networks, 2003. http://www.myri.com/scs/GM-2/doc/html/.
17. D. Patterson and J.Hennessy. Computer Architecture. A Quantitative Approach, pages 373-504. Morgan Kaufmann Pub., San Francisco. CA, 3rd edition, 2002.
18. M. Pettersson. The Perfctr Linux Performance Monitoring Counters Driver, 2004. http://user.it.uu.se/mikpe/linux/perfctr/.
19. M. S. Squiillante and E. D. Lazowska. Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems, 4(2):131-143, 1993.
20. G. E. Suh, S. Devadas, and L. Rudolph. A New Memory Monitoring Scheme for Memory-Aware Scheduling and Partitioning. In Proceedings of the Eighth International Symposium on High-Performance Computer Architecture (HPCA'02), pages 117-, 2002.
21. G. E. Suh, L. Rudolph, and S. Devadas. Effects of Memory Performance on Parallel Job Scheduling. Lecture Notes in Computer Science, 2221:116-, 2001.
22. J. Torrellas, A. Tucker, and A. Gupta. Evaluating the Performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors. Journal of Parallel and Distributed Computing, 24(2):139-151, 1995.
23. R. Vaswani and J. Zahorjan. The Implications of Cache Affinity on Processor Scheduling for Multiprogrammed, Shared Memory Multiprocessors. In Proceedings of the 13th ACM Symposium on Operating Systems Principles (SOSP'91), pages 26-40. ACM Press. 1991.
24. M. Zagha, B. Larson, S. Turner, and M. Itzkowitz. Performance Analysis using the MIPS R10000 Performance Counters. In. Proceedings of the 1996 ACM/IEEE Supercomputing Conference on High Performance Networking and Computing (SC96), page 16. ACM Press, Nov 1996.