A LOW OVERHEAD SCHEDULE FOR A 3D-GRID GRAPH-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A LOW OVERHEAD SCHEDULE FOR A 3D-GRID GRAPH

Published:1992-12 Issue:04 Volume:02 Page:363-372
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

BAMPIS E.¹,KÖNIG J.-C.¹,TRYSTRAM D.²

Affiliation:

1. LRI, Bât 490, Université de Paris Sud, 91405 Orsay Cedex, France

2. LMC-IMAG, 46 Avenue F. Viallet, 38031 Grenoble Cedex, France

Abstract

We propose a new scheduling algorithm for a three-dimensional grid precedence graph of size n, and we prove that the communication overhead is just in Θ( log log n). Finally, we show that a lower bound for the overhead of any schedule with a fixed number of processors (p ≥ 3) is Ω( log log n).

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626492000519

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scheduling 2-dimensional grids with large communication delays;RAIRO - Operations Research;2015-01-19

2. Optimal schedules for d-D grid graphs with communication delays;Parallel Computing;1998-10

3. Some models for scheduling parallel programs with communication delays;Discrete Applied Mathematics;1997-01

4. Minimizing the schedule length for a parallel 3D-grid precedence graph;European Journal of Operational Research;1996-12

5. Optimal schedules for d-D grid graphs with communication delays;STACS 96;1996

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP