Sciweavers

1257 search results - page 113 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
CCGRID
2007
IEEE
15 years 5 months ago
Mobility-Aware Efficient Job Scheduling in Mobile Grids
In this paper, we present a node mobility prediction framework based on a generic mobile grid architecture. We show how this framework can be used to formulate a cost effective job...
Preetam Ghosh, Nirmalya Roy, Sajal K. Das
EUROPAR
2008
Springer
15 years 3 months ago
Scheduling Intersection Queries in Term Partitioned Inverted Files
Abstract. This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put em...
Mauricio Marín, Carlos Gomez-Pantoja, Senen...
ICPPW
2000
IEEE
15 years 6 months ago
Scheduling Multiple Multicast for Heterogeneous Network of Workstations with Non-Blocking Message-Passing
This paper proposes efficient algorithms for implementing multicast in heterogeneous workstation/PC clusters. Multicast is an important operation in many scientific and industri...
Shih-Hsien Yeh, Jan-Jan Wu, Pangfeng Liu
107
Voted
JDA
2008
85views more  JDA 2008»
15 years 1 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
115
Voted
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 5 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde