Some models for scheduling parallel programs with communication delays
21
TL;DR: The aim of this paper is to present and analyze models for designing parallel programs in the context of some extensions of the most popular execution models (precedence graphs, dataflow, PRAM), and describe scheduling techniques which take into account the communication delays.
read more
About: This article is published in Discrete Applied Mathematics. The article was published on 10 Jan 1997. and is currently open access. The article focuses on the topics: Dataflow & Scheduling (computing).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
European journal of operational research
R. Słowiński,S. Rebennack,R. Teunter,M. Yearworth,A. Mercer,B. Tilanus,H.-J. Zimmermann,C. Archetti,R. Bai,Ana Paula Barbosa-Póvoa,Técnico Lisboa,A. Ben-Tal,Jean-Charles Billaut,N. Boysen,S. Bozoki,J. Branke,Dirk Briskorn,M. Caramia,J. Carlier,J. Crook,Federico Della Croce,E. D. Demeulemeester,Ku Leuven,Belgium Leuven,Disney,Michael Doumpos,M. Figueira,L. A. Franco,A. Gavious,J. Gondzio,S. Greco,V. Hemmelmayr,S. Howick,Masahiro Inuiguchi,F. Jaehn,M. P. Johnson,D. Kadziński,C. Kao,G. Kou,Mikhail Y. Kovalyov,T. Liu,R. M’Hallah,R. Martí,J. M. Martinez,Benedetto Matarazzo,W. Michalowski,Anca Minca,Anna Nagurney,Y. Peng,Ulrich Pferschy,M. Recchioni,R. Ruiz,S. Salman,C. Schwindt,D. Shabtay,S. Shen,T. S. Spengler,F. M. B. Toledo,P. Toth,D. Tuyttens,G. Berghe,R. Vetschera,J. Wallenius,J. Weglarz,David Wozabal,X. Zhou,J. Zhu +66 more
491
•Proceedings Article
Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract)
Christos H. Papadimitriou,Mihalis Yannakakis +1 more
- 01 Jan 1988
TL;DR: It would be very interesting if the authors could combine stages (3) and (4) into a single step whereby the performance of the algorithm is measured as the makespan of the schedule (elapsed time for computing the last result).
176
Parallel resolvent Monte Carlo algorithms for linear algebra problems
TL;DR: This paper considers Monte Carlo algorithms based on the use of the resolvent matrix for solving linear algebraic problems and estimates for the speedup and efficiency of the algorithms are presented.
43
Scheduling on Large Scale Distributed Platforms: From Models to Implementations
TL;DR: This paper investigates two complementary computational models that have been proposed recently: Parallel Task (PT) and Divisible Load (DL), and shows that in spite of the enormous complexity of the general scheduling problem on new platforms, it is still useful to study theoretical models.
Scheduling UET Trees with Communication Delays on two Processors
Frédéric Guinand,Denis Trystman +1 more
TL;DR: A new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors based on clustering of tasks and it is shown that this algorithm builds optimal schedules.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Communication complexity of PRAMs
Alok Aggarwal,Ashok K. Chandra,Marc Snir +2 more
- 13 Mar 1990
TL;DR: A model for the concurrent read exclusive write PRAM that captures its communication and computational requirements is proposed and several results are presented, including the following.
289
•Proceedings Article
Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract)
Christos H. Papadimitriou,Mihalis Yannakakis +1 more
- 01 Jan 1988
TL;DR: It would be very interesting if the authors could combine stages (3) and (4) into a single step whereby the performance of the algorithm is measured as the makespan of the schedule (elapsed time for computing the last result).
176
Related Papers (5)
Stefan K. Muller,Sam Westrick,Umut A. Acar +2 more
- 26 Jul 2019
M. Saksena,Hon Fung Li,Yun Wang +2 more
- 01 Jan 2001