Sciweavers

1257 search results - page 11 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
ICCSA
2005
Springer
15 years 3 months ago
A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The prima...
Mahmood R. Minhas, Sadiq M. Sait
ICPADS
2006
IEEE
15 years 3 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
TPDS
2002
80views more  TPDS 2002»
14 years 9 months ago
Low-Cost Task Scheduling for Distributed-Memory Machines
Andrei Radulescu, Arjan J. C. van Gemund
ICPP
1999
IEEE
15 years 2 months ago
FLB: Fast Load Balancing for Distributed-Memory Machines
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
Andrei Radulescu, Arjan J. C. van Gemund
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
15 years 10 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...