LEADER 09205nam 22008415 450 001 9910143890803321 005 20251116234301.0 010 $a3-540-36180-4 024 7 $a10.1007/3-540-36180-4 035 $a(CKB)1000000000211874 035 $a(SSID)ssj0000324219 035 $a(PQKBManifestationID)11242573 035 $a(PQKBTitleCode)TC0000324219 035 $a(PQKBWorkID)10305389 035 $a(PQKB)10110527 035 $a(DE-He213)978-3-540-36180-0 035 $a(MiAaPQ)EBC3072053 035 $a(PPN)155188690 035 $a(BIP)7994837 035 $a(EXLCZ)991000000000211874 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aJob Scheduling Strategies for Parallel Processing $e8th International Workshop, JSSPP 2002, Edinburgh, Scotland, UK, July 24, 2002, Revised Papers /$fedited by Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (VIII, 244 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2537 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-00172-7 320 $aIncludes bibliographical references and index. 327 $aA Self-Tuning Job Scheduler Family with Dynamic Policy Switching -- Preemption Based Backfill -- Job Scheduling for the BlueGene/L System -- Selective Reservation Strategies for Backfill Job Scheduling -- Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems -- Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy -- The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance -- Economic Scheduling in Grid Computing -- SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems -- Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems -- Practical Heterogeneous Placeholder Scheduling in Overlay Metacomputers: Early Experiences -- Current Activities in the Scheduling and Resource Management Area of the Global Grid Forum. 330 $aThisvolumecontainsthepaperspresentedatthe8thWorkshoponJobSched- ingStrategiesforParallelProcessing,whichwasheldinconjunctionwith HPDC11andGGF5inEdinburgh,UK,onJuly24,2002. Thepapershave beenthroughacompletereviewprocess,withthefullversionbeingreadand evaluatedby'vetosevenmembersoftheprogramcommittee. Wewouldliketo takethisopportunitytothanktheprogramcommittee,AndreaArpaci-Dusseau, WalfredoCirne,AllenDowney,WolfgangGentzsch,AllanGottlieb,MoeJette, RichardLagerstrom,JensMache,CathyMcCann,ReaganMoore,BillNitzberg, MarkSquillante,andJohnTowns,foranexcellentjob. Thanksarealsodueto theauthorsfortheirsubmissions,presentations,and'nalrevisionsforthisv- ume. Finally,wewouldliketothanktheMITLaboratoryforComputerScience andtheSchoolofComputerScienceandEngineeringattheHebrewUniversity fortheuseoftheirfacilitiesinthepreparationoftheseproceedings. Thisyearsawanemphasisontwomainthemes. The'rstwastheclassical MPPschedulingarea. Themainfocusinthisareawasonback'lling,including severaladvancedvariationsonthebasicscheme. Itisalsonoteworthythatseveral papersdiscussedtheuseofadaptivenessinjobscheduling. Thesecondmajor themewasschedulinginthecontextofgridcomputing,whichisemergingasan areaofmuchactivityandrapidprogress. Thesearecomplementedbyaninvited paperprovidinganoverviewoftheschedulingandresourcemanagementareaof theGlobalGridForum(GGF)e'ort. Thiswastheeighthannualworkshopinthisseries,whichre'ectsthec- tinuedinterestinthisarea. Theproceedingsofpreviousworkshopsareavailable fromSpringer-VerlagasLNCSvolumes949,1162,1291,1459,1659,1911,and 2221(andsince1998theyhavealsobeenavailableonline). Wehopeyou'ndthesepapersinterestinganduseful. September2002 DrorFeitelson LarryRudolph UweSchwiegelshohn Table of Contents ASelf-TuningJobSchedulerFamilywithDynamicPolicySwitching . . . . . . . . 1 AchimStreit PreemptionBasedBack'll. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 QuinnO. Snell,MarkJ. Clement,andDavidB. Jackson JobSchedulingfortheBlueGene/LSystem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 ElieKrevat,Jos´eG. Castan~os,andJos´eE. Moreira SelectiveReservationStrategiesforBack'llJobScheduling. . . . . . . . . . . . . . . . . 55 SrividyaSrinivasan,RajkumarKettimuthu,VijaySubramani, andPonnuswamySadayappan Multiple-QueueBack'llingSchedulingwithPrioritiesandReservations forParallelSystems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 BarryG. LawsonandEvgeniaSmirni SchedulingJobsonParallelSystemsUsingaRelaxedBack'llStrategy. . . . . 88 WilliamA. Ward,Jr. ,CarrieL. Mahood,andJohnE. West TheImpactofMoreAccurateRequestedRuntimes onProductionJobSchedulingPerformance. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103 Su-HuiChiang,AndreaArpaci-Dusseau,andMaryK. Vernon EconomicSchedulinginGridComputing. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 CarstenErnemann,VolkerHamscher,andRaminYahyapour SNAP:AProtocolforNegotiatingServiceLevelAgreements andCoordinatingResourceManagementinDistributedSystems. . . . . . . . . . 153 KarlCzajkowski,IanFoster,CarlKesselman,VolkerSander, andStevenTuecke LocalversusGlobalSchedulerswithProcessorCo-allocation inMulticlusterSystems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184 AncaI. D. BucurandDickH. J. Epema PracticalHeterogeneousPlaceholderScheduling inOverlayMetacomputers:EarlyExperiences. . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 ChristopherPinchak,PaulLu,andMarkGoldenberg CurrentActivitiesintheSchedulingandResourceManagementArea oftheGlobalGridForum. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229 BillNitzbergandJenniferM. Schopf Author Index. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 ASelf-TuningJobSchedulerFamily withDynamic PolicySwitching Achim Streit 2 PC - Paderborn Center for Parallel Computing, Paderborn University 33102 Paderborn, Germany streit@upb. de http://www. upb. de/pc2 Abstract. The performance of job scheduling policies strongly depends on the properties of the incoming jobs. If the job characteristics often change, the scheduling policy should follow these changes. For this p- pose the dynP job scheduler family has been developed. The idea is to dynamically switch the scheduling policy during runtime. In a basic v- sion the policy switching is controlled by two parameters. The basic concept of theself-tuning dynP scheduler is to compute virtual schedules for each policy in every scheduling step. That policy is chosen which generates the ''best'' schedule. The performance of the self-tuning dynP scheduler no longer depends on a adequate setting of the input parameters. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2537 606 $aComputer architecture 606 $aOperating systems (Computers) 606 $aComputer arithmetic and logic units 606 $aComputer software?Reusability 606 $aMicroprocessors 606 $aComputer programming 606 $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 606 $aArithmetic and Logic Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I12026 606 $aPerformance and Reliability$3https://scigraph.springernature.com/ontologies/product-market-codes/I12077 606 $aProcessor Architectures$3https://scigraph.springernature.com/ontologies/product-market-codes/I13014 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 615 0$aComputer architecture. 615 0$aOperating systems (Computers) 615 0$aComputer arithmetic and logic units. 615 0$aComputer software?Reusability. 615 0$aMicroprocessors. 615 0$aComputer programming. 615 14$aComputer System Implementation. 615 24$aOperating Systems. 615 24$aArithmetic and Logic Structures. 615 24$aPerformance and Reliability. 615 24$aProcessor Architectures. 615 24$aProgramming Techniques. 676 $a004/.35 702 $aFeitelson$b Dror G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRudolph$b Larry$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSchwiegelshohn$b Uwe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aJSSPP 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143890803321 996 $aJob Scheduling Strategies for Parallel Processing$92569128 997 $aUNINA