Sciweavers

1257 search results - page 5 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
LSSC
2005
Springer
15 years 3 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
IJCSA
2007
110views more  IJCSA 2007»
14 years 9 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
APPT
2005
Springer
15 years 3 months ago
Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers
Abstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute d...
Kun-Ming Yu, Chi-Hsiu Chen, Ching-Hsien Hsu, Chang...
ICPP
2005
IEEE
15 years 3 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
2006
IEEE
15 years 3 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...