In this work we have considered a task graph model taking into account the communication. We have presented a complete analysis for scheduling a d-D grid ...

Optimal schedules for d-D grid graphs with communication delays. Extended abstract. Conference paper; First Online: 01 January 2005. pp 655–666; Cite this ...

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract) · Contents. STACS '96: Proceedings of the 13th Annual Symposium on ...

Abstract. We consider a task graph model taking into account the commu- nication among tasks of a parallel system. First, we assume that the available.

We survey the optimal time scheduling techniques for UET-UCT (unit execution time - unit communication time) grid topologies, using unbounded and bounded number ...

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 ...

Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). STACS 1996: 655-666; 1995. [j8]. view. electronic edition via DOI (open ...

In this paper we enhance the model of n-dimensional grid by adding extra diagonal edges. First, we calculate the optimal makespan for the generalized UET-UCT ...

Missing: (Extended Abstract).

Aug 1, 1991 · This paper addresses a machine scheduling problem that arises in the case of scheduling tasks over an idealized distributed multiprocessor.