Academic Journal
Scheduling explicitly-speculative tasks
| Τίτλος: | Scheduling explicitly-speculative tasks |
|---|---|
| Συγγραφείς: | David Petrou, Gregory R. Ganger, Garth A. Gibson |
| Έτος έκδοσης: | 2018 |
| Συλλογή: | KiltHub Research from Carnegie Mellon University |
| Θεματικοί όροι: | Other information and computing sciences not elsewhere classified, Operating systems (Computers), Electronic data processing Batch processing, Information and Computing Sciences not elsewhere classified |
| Περιγραφή: | "Large-scale computing often consists of many speculative tasks to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences and computer graphics artists adjusting scene properties. This paper promotes a new computing model for shared clusters and grids in which researchers and end-users exploring search spaces disclose sets of speculative tasks, request results as needed, and cancel unfinished tasks if early results suggest no need to continue. Doing so matches natural usage patterns, making users more effective, and also enables a new class of schedulers. In simulation, we demonstrate how batchactive schedulers significantly reduce user-observed response times relative to conventional models in which tasks are requested one at a time (interactively) or requested in batches without specifying which are speculative. Over a range of simulated user behavior, for 20% of our simulations, user-observed resonse time is at least two times better under a batchactive scheduler, and about 50% better on average. Batchactive schedulers achieve such improvements by segregating tasks into two queues based on whether a task is speculative and scheduling these queues separately. Moreover, we show how user costs can be reduced under an incentive cost model of charging only for tasks whose results are requested." |
| Τύπος εγγράφου: | article in journal/newspaper |
| Γλώσσα: | unknown |
| DOI: | 10.1184/R1/6609266.v1 |
| Διαθεσιμότητα: | https://doi.org/10.1184/R1/6609266.v1 https://figshare.com/articles/journal_contribution/Scheduling_explicitly-speculative_tasks/6609266 |
| Rights: | In Copyright |
| Αριθμός Καταχώρησης: | edsbas.839853D |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://doi.org/10.1184/R1/6609266.v1# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.839853D RelevancyScore: 802 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 802.436645507813 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Scheduling explicitly-speculative tasks – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22David+Petrou%22">David Petrou</searchLink><br /><searchLink fieldCode="AR" term="%22Gregory+R%2E+Ganger%22">Gregory R. Ganger</searchLink><br /><searchLink fieldCode="AR" term="%22Garth+A%2E+Gibson%22">Garth A. Gibson</searchLink> – Name: DatePubCY Label: Publication Year Group: Date Data: 2018 – Name: Subset Label: Collection Group: HoldingsInfo Data: KiltHub Research from Carnegie Mellon University – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Other+information+and+computing+sciences+not+elsewhere+classified%22">Other information and computing sciences not elsewhere classified</searchLink><br /><searchLink fieldCode="DE" term="%22Operating+systems+%28Computers%29%22">Operating systems (Computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing+Batch+processing%22">Electronic data processing Batch processing</searchLink><br /><searchLink fieldCode="DE" term="%22Information+and+Computing+Sciences+not+elsewhere+classified%22">Information and Computing Sciences not elsewhere classified</searchLink> – Name: Abstract Label: Description Group: Ab Data: "Large-scale computing often consists of many speculative tasks to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences and computer graphics artists adjusting scene properties. This paper promotes a new computing model for shared clusters and grids in which researchers and end-users exploring search spaces disclose sets of speculative tasks, request results as needed, and cancel unfinished tasks if early results suggest no need to continue. Doing so matches natural usage patterns, making users more effective, and also enables a new class of schedulers. In simulation, we demonstrate how batchactive schedulers significantly reduce user-observed response times relative to conventional models in which tasks are requested one at a time (interactively) or requested in batches without specifying which are speculative. Over a range of simulated user behavior, for 20% of our simulations, user-observed resonse time is at least two times better under a batchactive scheduler, and about 50% better on average. Batchactive schedulers achieve such improvements by segregating tasks into two queues based on whether a task is speculative and scheduling these queues separately. Moreover, we show how user costs can be reduced under an incentive cost model of charging only for tasks whose results are requested." – Name: TypeDocument Label: Document Type Group: TypDoc Data: article in journal/newspaper – Name: Language Label: Language Group: Lang Data: unknown – Name: DOI Label: DOI Group: ID Data: 10.1184/R1/6609266.v1 – Name: URL Label: Availability Group: URL Data: https://doi.org/10.1184/R1/6609266.v1<br />https://figshare.com/articles/journal_contribution/Scheduling_explicitly-speculative_tasks/6609266 – Name: Copyright Label: Rights Group: Cpyrght Data: In Copyright – Name: AN Label: Accession Number Group: ID Data: edsbas.839853D |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.839853D |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1184/R1/6609266.v1 Languages: – Text: unknown Subjects: – SubjectFull: Other information and computing sciences not elsewhere classified Type: general – SubjectFull: Operating systems (Computers) Type: general – SubjectFull: Electronic data processing Batch processing Type: general – SubjectFull: Information and Computing Sciences not elsewhere classified Type: general Titles: – TitleFull: Scheduling explicitly-speculative tasks Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: David Petrou – PersonEntity: Name: NameFull: Gregory R. Ganger – PersonEntity: Name: NameFull: Garth A. Gibson IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2018 Identifiers: – Type: issn-locals Value: edsbas |
| ResultId | 1 |