{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:18:08Z","timestamp":1725484688931},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428176"},{"type":"electronic","value":"9783540455400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45540-x_3","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:37:01Z","timestamp":1180658221000},"page":"21-40","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters"],"prefix":"10.1007","author":[{"given":"Andy B.","family":"Yoo","sequence":"first","affiliation":[]},{"given":"Morris A.","family":"Jette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/40.342018","volume":"15","author":"T. E. Anderson","year":"1995","unstructured":"T. E. Anderson, D. E. Culler, and D. A. Patterson. A Case for NOW (Networks of Workstations). IEEE Micro, 15(1):54\u201364, Feb. 1995.","journal-title":"IEEE Micro"},{"doi-asserted-by":"crossref","unstructured":"A. C. Arpaci-Dusseau, D. E. Culler, and A. M. Mainwaring. Scheduling with Implicit Information in Distributed Systems. In Proc. ACM SIGMETRICS 1998 Conf. on Measurement and Modeling of Computer Ssystems, 1998.","key":"3_CR2","DOI":"10.1145\/277851.277927"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1177\/109434209100500306","volume":"5","author":"D. H. Bailey","year":"1991","unstructured":"D. H. Bailey et al. The NAS Parallel Benchmarks. International Journal of Supercomputer Applications, 5:63\u201373, 1991.","journal-title":"International Journal of Supercomputer Applications"},{"unstructured":"D. H. Bailey et al. The NAS Parallel Benchmarks. Technical Report NASA Technical Memorandom 103863, NASA Ames Research Center, 1993.","key":"3_CR4"},{"unstructured":"D. H. Bailey et al. The NAS Parallel Benchmarks 2.0. Technical Report NAS-95-020, NASA Ames Research Center, Dec. 1995.","key":"3_CR5"},{"unstructured":"D. H. Bailey et al. Valuation of Ultra-Scale Computing Systems: A White Paper, Dec. 1999.","key":"3_CR6"},{"doi-asserted-by":"crossref","unstructured":"D. G. Feitelson. Memory Usage in the LANL CM-5 Workload. In Proc. IPPS\u201997 Workshop on Job Scheduling St rategies for Parallel Processing, pages 78\u201394, 1997.","key":"3_CR7","DOI":"10.1007\/3-540-63574-2_17"},{"key":"3_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-63574-2_24","volume-title":"Proc. IPPS\u201997 Workshop on Job Scheduling Strategies for Parallel Processing","author":"D. G. Feitelson","year":"1997","unstructured":"D. G. Feitelson and M. Jette. Improved Utilization and Responsiveness with Gang Scheduling. In Proc. IPPS\u201997 Workshop on Job Scheduling Strategies for Parallel Processing, Vol. 1291 of Lecture Notes in Computer Science, pages 238\u2013261. Springer-Verlag, Apr. 1997."},{"unstructured":"H. Franke, P. Pattnaik, and L. Rudolph. Gang Scheduling for Highly Effcient Multiprocessors. In Proc. Sixth Symp. on the Frontiers of Massively Parallel Processing, Oct. 1996.","key":"3_CR9"},{"key":"3_CR10","first-page":"54","volume":"22","author":"W. Gropp","year":"1995","unstructured":"W. Gropp and E. Lusk. A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard. Parallel Computing, 22:54\u201364, Feb. 1995.","journal-title":"Parallel Computing"},{"unstructured":"IBM Corporation. LoadLeveler\u2019s User Guide, Release 2.1.","key":"3_CR11"},{"doi-asserted-by":"crossref","unstructured":"J. E. Moreira et al. A Gang-Scheduling System for ASCI Blue-Pacific. In Proc. Distributed Computing and Metacomputing (DCM) Workshop, High-Performance Computing and Networking\u2019 99, Apr. 1999.","key":"3_CR12","DOI":"10.1007\/BFb0100643"},{"doi-asserted-by":"crossref","unstructured":"M. Jette. Performance Characteristics of Gang Scheduling in Multiprogrammed Environments. In Proc. SuperComputing97, Nov. 1997.","key":"3_CR13","DOI":"10.1145\/509593.509647"},{"doi-asserted-by":"crossref","unstructured":"M. Jette. Expanding Symmetric Multiprocessor Capability Through Gang Scheduling. In Proc. IPPS\u201998 Workshop on Job Scheduling Strategies for Parallel Processing, Mar. 1998.","key":"3_CR14","DOI":"10.1007\/BFb0053988"},{"unstructured":"M. Jette, D. Storch, and E. Yim. Timesharing the Cray T3D. In CrayUser Group, pages 247\u2013252, Mar. 1996.","key":"3_CR15"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/40.342015","volume":"15","author":"N. J. Boden","year":"1995","unstructured":"N. J. Boden et al. Myrinet: A Gigabit-per-second Local Area Network. IEEE Micro, 15(1):29\u201336, Feb. 1995.","journal-title":"IEEE Micro"},{"doi-asserted-by":"crossref","unstructured":"S. Nagar, A. Banerjee, A. Sivasubramaniam, and C. R. Das. A Closer Look At Coscheduling Approaches for a Network of Workstations. In Proc. 11th ACM Symp. of Parallel Algorithms and Architectures, June 1999.","key":"3_CR17","DOI":"10.1145\/305619.305630"},{"unstructured":"J. K. Ousterhout. Scheduling Technique for Concurrent Systems. In Proc. Int\u2019l Conf. on Distributed Computing Systems, pages 22\u201330, 1982.","key":"3_CR18"},{"doi-asserted-by":"crossref","unstructured":"S. Pakin, M. Lauria, and A. Chien. High Performance Messaging on Workstations: Illinois Fast Meessages (FM). In Proc. Supercomputing\u2019 95, Dec. 1995.","key":"3_CR19","DOI":"10.1145\/224170.224360"},{"unstructured":"S. Saini and D. H. Bailey. NAS Parallel Benchmark (Version 1.0) Results 11-96. Technical Report NAS-96-18, NASA Ames Research Center, Nov. 1996.","key":"3_CR20"},{"key":"3_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BFb0022286","volume-title":"Proc. IPPS\u201996 Workshop on Job Scheduling Strategies for Parallel Processing","author":"J. Skovira","year":"1996","unstructured":"J. Skovira, W. Chan, H. Zhou, and D. Lifka. The Easy-LoadLeveler API Project. In Proc. IPPS\u201996 Workshop on Job Scheduling Strategies for Parallel Processing, Vol. 1162 of Lecture Notes in Computer Science, pages 41\u201347. Springer-Verlag, Apr. 1996."},{"unstructured":"P. G. Sobalvarro. Demand-based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors. PhD thesis, Dept. of Electrical Engineering and Compuer Science, Massachusetts Institutute of Technology, 1997.","key":"3_CR22"},{"doi-asserted-by":"crossref","unstructured":"P. G. Sobalvarro and W. E. Weihl. Demand-based Coscheduling of Parallel Jobs on Multipr ogrammed Multiprocessors. In Proc. IPPS\u201995 Workshop on Job Scheduling Strategies for Parallel Processing, pages 63\u201375, Apr. 1995.","key":"3_CR23","DOI":"10.1007\/3-540-60153-8_25"},{"doi-asserted-by":"crossref","unstructured":"T. von Eicken and A. Basu and V. Buch and W. Vogels. U-Nnet: A User-Level Network Interface for Parallel and Distributed Computing. In Proc. 15th ACM Symp. on Operating System Principles, Dec. 1995.","key":"3_CR24","DOI":"10.1145\/224056.224061"},{"unstructured":"T. von Eicken and D. E. Culler and S. C. Goldsten and K. E. Schauser. Active Messages: A Mechanism for Integrated Communication and Computation. In Proc. 19th Annual Int\u2019l Symp. on Computer Architecture, Dec. 1995.","key":"3_CR25"},{"issue":"2","key":"3_CR26","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1006\/jpdc.1998.1498","volume":"55","author":"B. S. Yoo","year":"1998","unstructured":"B. S. Yoo and C. R. Das. A Fast and Effcient Processor Management Scheme for k-ary n-cubes. Journal of Parallel and Distributed Computing, 55(2):192\u2013214, Dec. 1998.","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45540-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:22:03Z","timestamp":1556450523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45540-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428176","9783540455400"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45540-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}