Loading…

Cluster Scheduling for Explicitly-Speculative Tasks

A process schedule on a shared cluster, grid, or supercomputer that is informed which submitted tasks are possibly unneeded speculative tasks can use this knowledge to better support increasingly prevalent user work habits, lowering user-visible response time, lowering user costs, and increasing res...

Full description

Saved in:
Bibliographic Details
Main Author: Petrou, David
Format: Report
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Petrou, David
description A process schedule on a shared cluster, grid, or supercomputer that is informed which submitted tasks are possibly unneeded speculative tasks can use this knowledge to better support increasingly prevalent user work habits, lowering user-visible response time, lowering user costs, and increasing resource provider revenue. Large-scale computing often consists of many speculative tasks (tasks that may be canceled) to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences, computer graphics artists rendering scenes, and computer researchers studying caching. This behavior - exploratory searches and parameter studies, made more common by the cost-effectiveness of cluster computing - on existing schedulers without speculative task support results in a mismatch of goals and suboptimal scheduling. Users wish to reduce results in a mismatch of goals and suboptimal scheduling. Users wish to reduce their time waiting for needed task output and the amount they will be charged for unneeded speculation, making it unclear to the user how many speculative tasks they should submit. This thesis introduces 'batchactive' scheduling (combining batch and interactive characteristics) to exploit the inherent speculation in common application scenarios. With a bachactive scheduler, users submit explicityly-labeled batches of speculative tasks exploring ambitious lines of inquiry, and users interactively request task outputs when these outputs are found to be needed. After receiving and considering an output for some time, a user decides whether to request more outputs, cancel tasks, or disclose new speculative tasks. Sponsored in part by National Science Foundation.
format report
fullrecord <record><control><sourceid>dtic_1RU</sourceid><recordid>TN_cdi_dtic_stinet_ADA490320</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ADA490320</sourcerecordid><originalsourceid>FETCH-dtic_stinet_ADA4903203</originalsourceid><addsrcrecordid>eNrjZDB2ziktLkktUghOzkhNKc3JzEtXSMsvUnCtKMjJTM4syanUDS5ITS7NSSzJLEtVCEkszi7mYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4ujiaWBsZGBsYEpAFdSynI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>report</recordtype></control><display><type>report</type><title>Cluster Scheduling for Explicitly-Speculative Tasks</title><source>DTIC Technical Reports</source><creator>Petrou, David</creator><creatorcontrib>Petrou, David ; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING</creatorcontrib><description>A process schedule on a shared cluster, grid, or supercomputer that is informed which submitted tasks are possibly unneeded speculative tasks can use this knowledge to better support increasingly prevalent user work habits, lowering user-visible response time, lowering user costs, and increasing resource provider revenue. Large-scale computing often consists of many speculative tasks (tasks that may be canceled) to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences, computer graphics artists rendering scenes, and computer researchers studying caching. This behavior - exploratory searches and parameter studies, made more common by the cost-effectiveness of cluster computing - on existing schedulers without speculative task support results in a mismatch of goals and suboptimal scheduling. Users wish to reduce results in a mismatch of goals and suboptimal scheduling. Users wish to reduce their time waiting for needed task output and the amount they will be charged for unneeded speculation, making it unclear to the user how many speculative tasks they should submit. This thesis introduces 'batchactive' scheduling (combining batch and interactive characteristics) to exploit the inherent speculation in common application scenarios. With a bachactive scheduler, users submit explicityly-labeled batches of speculative tasks exploring ambitious lines of inquiry, and users interactively request task outputs when these outputs are found to be needed. After receiving and considering an output for some time, a user decides whether to request more outputs, cancel tasks, or disclose new speculative tasks. Sponsored in part by National Science Foundation.</description><language>eng</language><subject>BATCH PROCESSING ; BATCHACTIVE SCHEDULING ; CLUSTER COMPUTING ; CLUSTERING ; Computer Programming and Software ; COMPUTER PROGRAMS ; Computer Systems ; COSTS ; DEOXYRIBONUCLEIC ACIDS ; DNA SEQUENCES ; GRID COMPUTING ; GRIDS ; INTERACTIVE GRAPHICS ; OPERATING SYSTEMS(COMPUTERS) ; OPTIMISTIC SCHEDULING ; OUTPUT ; PROCESS MANAGEMENT ; SCHEDULING ; SPECULATIVE SCHEDULING ; SUPERCOMPUTERS ; THESES ; USER NEEDS</subject><creationdate>2004</creationdate><rights>Approved for public release; distribution is unlimited.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,780,885,27567,27568</link.rule.ids><linktorsrc>$$Uhttps://apps.dtic.mil/sti/citations/ADA490320$$EView_record_in_DTIC$$FView_record_in_$$GDTIC$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Petrou, David</creatorcontrib><creatorcontrib>CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING</creatorcontrib><title>Cluster Scheduling for Explicitly-Speculative Tasks</title><description>A process schedule on a shared cluster, grid, or supercomputer that is informed which submitted tasks are possibly unneeded speculative tasks can use this knowledge to better support increasingly prevalent user work habits, lowering user-visible response time, lowering user costs, and increasing resource provider revenue. Large-scale computing often consists of many speculative tasks (tasks that may be canceled) to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences, computer graphics artists rendering scenes, and computer researchers studying caching. This behavior - exploratory searches and parameter studies, made more common by the cost-effectiveness of cluster computing - on existing schedulers without speculative task support results in a mismatch of goals and suboptimal scheduling. Users wish to reduce results in a mismatch of goals and suboptimal scheduling. Users wish to reduce their time waiting for needed task output and the amount they will be charged for unneeded speculation, making it unclear to the user how many speculative tasks they should submit. This thesis introduces 'batchactive' scheduling (combining batch and interactive characteristics) to exploit the inherent speculation in common application scenarios. With a bachactive scheduler, users submit explicityly-labeled batches of speculative tasks exploring ambitious lines of inquiry, and users interactively request task outputs when these outputs are found to be needed. After receiving and considering an output for some time, a user decides whether to request more outputs, cancel tasks, or disclose new speculative tasks. Sponsored in part by National Science Foundation.</description><subject>BATCH PROCESSING</subject><subject>BATCHACTIVE SCHEDULING</subject><subject>CLUSTER COMPUTING</subject><subject>CLUSTERING</subject><subject>Computer Programming and Software</subject><subject>COMPUTER PROGRAMS</subject><subject>Computer Systems</subject><subject>COSTS</subject><subject>DEOXYRIBONUCLEIC ACIDS</subject><subject>DNA SEQUENCES</subject><subject>GRID COMPUTING</subject><subject>GRIDS</subject><subject>INTERACTIVE GRAPHICS</subject><subject>OPERATING SYSTEMS(COMPUTERS)</subject><subject>OPTIMISTIC SCHEDULING</subject><subject>OUTPUT</subject><subject>PROCESS MANAGEMENT</subject><subject>SCHEDULING</subject><subject>SPECULATIVE SCHEDULING</subject><subject>SUPERCOMPUTERS</subject><subject>THESES</subject><subject>USER NEEDS</subject><fulltext>true</fulltext><rsrctype>report</rsrctype><creationdate>2004</creationdate><recordtype>report</recordtype><sourceid>1RU</sourceid><recordid>eNrjZDB2ziktLkktUghOzkhNKc3JzEtXSMsvUnCtKMjJTM4syanUDS5ITS7NSSzJLEtVCEkszi7mYWBNS8wpTuWF0twMMm6uIc4euiklmcnxxSWZeakl8Y4ujiaWBsZGBsYEpAFdSynI</recordid><startdate>200412</startdate><enddate>200412</enddate><creator>Petrou, David</creator><scope>1RU</scope><scope>BHM</scope></search><sort><creationdate>200412</creationdate><title>Cluster Scheduling for Explicitly-Speculative Tasks</title><author>Petrou, David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-dtic_stinet_ADA4903203</frbrgroupid><rsrctype>reports</rsrctype><prefilter>reports</prefilter><language>eng</language><creationdate>2004</creationdate><topic>BATCH PROCESSING</topic><topic>BATCHACTIVE SCHEDULING</topic><topic>CLUSTER COMPUTING</topic><topic>CLUSTERING</topic><topic>Computer Programming and Software</topic><topic>COMPUTER PROGRAMS</topic><topic>Computer Systems</topic><topic>COSTS</topic><topic>DEOXYRIBONUCLEIC ACIDS</topic><topic>DNA SEQUENCES</topic><topic>GRID COMPUTING</topic><topic>GRIDS</topic><topic>INTERACTIVE GRAPHICS</topic><topic>OPERATING SYSTEMS(COMPUTERS)</topic><topic>OPTIMISTIC SCHEDULING</topic><topic>OUTPUT</topic><topic>PROCESS MANAGEMENT</topic><topic>SCHEDULING</topic><topic>SPECULATIVE SCHEDULING</topic><topic>SUPERCOMPUTERS</topic><topic>THESES</topic><topic>USER NEEDS</topic><toplevel>online_resources</toplevel><creatorcontrib>Petrou, David</creatorcontrib><creatorcontrib>CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING</creatorcontrib><collection>DTIC Technical Reports</collection><collection>DTIC STINET</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Petrou, David</au><aucorp>CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF ELECTRICAL AND COMPUTER ENGINEERING</aucorp><format>book</format><genre>unknown</genre><ristype>RPRT</ristype><btitle>Cluster Scheduling for Explicitly-Speculative Tasks</btitle><date>2004-12</date><risdate>2004</risdate><abstract>A process schedule on a shared cluster, grid, or supercomputer that is informed which submitted tasks are possibly unneeded speculative tasks can use this knowledge to better support increasingly prevalent user work habits, lowering user-visible response time, lowering user costs, and increasing resource provider revenue. Large-scale computing often consists of many speculative tasks (tasks that may be canceled) to test hypotheses, search for insights, and review potentially finished products. For example, speculative tasks are issued by bioinformaticists comparing DNA sequences, computer graphics artists rendering scenes, and computer researchers studying caching. This behavior - exploratory searches and parameter studies, made more common by the cost-effectiveness of cluster computing - on existing schedulers without speculative task support results in a mismatch of goals and suboptimal scheduling. Users wish to reduce results in a mismatch of goals and suboptimal scheduling. Users wish to reduce their time waiting for needed task output and the amount they will be charged for unneeded speculation, making it unclear to the user how many speculative tasks they should submit. This thesis introduces 'batchactive' scheduling (combining batch and interactive characteristics) to exploit the inherent speculation in common application scenarios. With a bachactive scheduler, users submit explicityly-labeled batches of speculative tasks exploring ambitious lines of inquiry, and users interactively request task outputs when these outputs are found to be needed. After receiving and considering an output for some time, a user decides whether to request more outputs, cancel tasks, or disclose new speculative tasks. Sponsored in part by National Science Foundation.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_dtic_stinet_ADA490320
source DTIC Technical Reports
subjects BATCH PROCESSING
BATCHACTIVE SCHEDULING
CLUSTER COMPUTING
CLUSTERING
Computer Programming and Software
COMPUTER PROGRAMS
Computer Systems
COSTS
DEOXYRIBONUCLEIC ACIDS
DNA SEQUENCES
GRID COMPUTING
GRIDS
INTERACTIVE GRAPHICS
OPERATING SYSTEMS(COMPUTERS)
OPTIMISTIC SCHEDULING
OUTPUT
PROCESS MANAGEMENT
SCHEDULING
SPECULATIVE SCHEDULING
SUPERCOMPUTERS
THESES
USER NEEDS
title Cluster Scheduling for Explicitly-Speculative Tasks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T00%3A44%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-dtic_1RU&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=unknown&rft.btitle=Cluster%20Scheduling%20for%20Explicitly-Speculative%20Tasks&rft.au=Petrou,%20David&rft.aucorp=CARNEGIE-MELLON%20UNIV%20PITTSBURGH%20PA%20DEPT%20OF%20ELECTRICAL%20AND%20COMPUTER%20ENGINEERING&rft.date=2004-12&rft_id=info:doi/&rft_dat=%3Cdtic_1RU%3EADA490320%3C/dtic_1RU%3E%3Cgrp_id%3Ecdi_FETCH-dtic_stinet_ADA4903203%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true