Sciweavers

280 search results - page 3 / 56
» Quasi-Static Scheduling of Communicating Tasks
Sort
View
ICPP
2005
IEEE
13 years 11 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
IPPS
2000
IEEE
13 years 9 months ago
S3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors
We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task sc...
Oh-Han Kang, Dharma P. Agrawal
CIRA
2007
IEEE
182views Robotics» more  CIRA 2007»
13 years 11 months ago
Communication-Efficient Dynamic Task Scheduling for Heterogeneous Multi-Robot Systems
— In this paper, a communication-efficient dynamic task scheduling algorithm for a heterogeneous multi-robot system is proposed. To make this task scheduling algorithm to be scal...
Kashyap Shah, Yan Meng
CCGRID
2008
IEEE
13 years 11 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
DATE
2007
IEEE
167views Hardware» more  DATE 2007»
13 years 11 months ago
A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multip
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
Nadathur Satish, Kaushik Ravindran, Kurt Keutzer