Job Scheduling Strategies for Parallel Processing [electronic resource] : 8th International Workshop, JSSPP 2002 Edinburgh, Scotland, UK, July 24, 2002 Revised Papers / edited by Dror G. Feitelson, Larry Rudolph, Uwe Schwiegelshohn.

By: Feitelson, Dror G [editor.]Contributor(s): Rudolph, Larry [editor.] | Schwiegelshohn, Uwe [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 2537Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002Description: VIII, 244 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540361800Subject(s): Computer science | Operating systems (Computers) | Computer software | Computer Science | Operating Systems | Arithmetic and Logic Structures | Performance and Reliability | Processor Architectures | Programming Techniques | Algorithm Analysis and Problem ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 005.43 LOC classification: QA76.76.O63Online resources: Click here to access online
Contents:
A 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.
In: Springer eBooksSummary: Thisvolumecontainsthepaperspresentedatthe8thWorkshoponJobSched- 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

A 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.

Thisvolumecontainsthepaperspresentedatthe8thWorkshoponJobSched- 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.

There are no comments on this title.

to post a comment.


Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha