Scheduling Periodic Task Graphs with Communication Delays Anton Riabov and J a y Sethuraman IEOR Department Columbia University 500 West 120 Street New York, NY 10027. {anton, jay} @ieor.columbia.edu Abstract We consider the problem of finding an optimal assignment of tasks, which constitute a parallel application, to an unlimited number of identical processors. The precedence constraints among the tasks are given in the form of a directed acyclic graph (DAG). We are given processing times for each task and the communication delays between precedence-constrained tasks, which are incurred if the corresponding tasks are executed on different processors. Furthermore, the system must be able to process real-time periodic input with a fixed period. This problem occurs, for example, in multiprocessor scheduling of video processing applications, where each frame has to be processed by a number of software filters, and some filters use data pre-processed by other filters, thus forming a DAG of data dependencies. We formulate several variants of this problem, and briefly discuss some of our results for special precedence graphs. are incurred when tasks are assigned to different machines; (ii) real-time periodic input constraints; and (iii) pipelining, which allows certain processors in the network to work on
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/scheduling-periodic-task-graphs-with-communication-delays-bndVS2uhk7
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Scheduling periodic task graphs with communication delays
Riabov, Anton; Sethuraman, Jay
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 29 (3)
Association for Computing Machinery – Dec 1, 2001
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
