04467nam 22007575 450 99646552060331620200702033651.03-540-69599-010.1007/3-540-63574-2(CKB)1000000000234731(SSID)ssj0000324223(PQKBManifestationID)11224789(PQKBTitleCode)TC0000324223(PQKBWorkID)10304532(PQKB)11529034(DE-He213)978-3-540-69599-8(PPN)155198513(EXLCZ)99100000000023473120121227d1997 u| 0engurnn|008mamaatxtccrJob Scheduling Strategies for Parallel Processing[electronic resource] IPPS '97 Workshop, Geneva, Switzerland, April 5, 1997, Proceedings /edited by Dror G. Feitelson, Larry Rudolph1st ed. 1997.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1997.1 online resource (VII, 305 p.) Lecture Notes in Computer Science,0302-9743 ;1291Bibliographic Level Mode of Issuance: Monograph3-540-63574-2 Theory and practice in parallel job scheduling -- Using queue time predictions for processor allocation -- A historical application profiler for use by parallel schedulers -- Memory usage in the LANL CM-5 workload -- Modeling of workload in MPPs -- PScheD Political scheduling on the CRAY T3E -- An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessors -- Implementing multiprocessor scheduling disciplines -- Objective-oriented algorithm for job scheduling in parallel heterogeneous systems -- Implications of I/O for gang scheduled workloads -- Improved utilization and responsiveness with gang scheduling -- Global state detection using network preemption -- Performance evaluation of gang scheduling for parallel and distributed multiprogramming.This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium. The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc.Lecture Notes in Computer Science,0302-9743 ;1291Architecture, ComputerOperating systems (Computers)Computer programmingAlgorithmsMicroprocessorsLogic designComputer System Implementationhttps://scigraph.springernature.com/ontologies/product-market-codes/I13057Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14045Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Processor Architectureshttps://scigraph.springernature.com/ontologies/product-market-codes/I13014Logic Designhttps://scigraph.springernature.com/ontologies/product-market-codes/I12050Architecture, Computer.Operating systems (Computers).Computer programming.Algorithms.Microprocessors.Logic design.Computer System Implementation.Operating Systems.Programming Techniques.Algorithm Analysis and Problem Complexity.Processor Architectures.Logic Design.005.4/3475Feitelson Dror Gedthttp://id.loc.gov/vocabulary/relators/edtRudolph Larryedthttp://id.loc.gov/vocabulary/relators/edtIPPS '97 WorkshopBOOK996465520603316Job Scheduling Strategies for Parallel Processing771868UNISA