Sciweavers

1050 search results - page 186 / 210
» Online scheduling in grids
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 7 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
UMUAI
2002
138views more  UMUAI 2002»
13 years 7 months ago
Designing and Evaluating an Adaptive Spoken Dialogue System
Spoken dialogue systemperformance canvary widely fordifferentusers, aswell for the same userduring different dialogues.This paper presents the design and evaluation ofan adaptive v...
Diane J. Litman, Shimei Pan
JPDC
2006
146views more  JPDC 2006»
13 years 7 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
CCGRID
2008
IEEE
14 years 2 months ago
Scalable Data Gathering for Real-Time Monitoring Systems on Distributed Computing
Real-time monitoring is increasingly becoming important in various scenes of large scale, multi-site distributed/parallel computing, e.g, understanding behavior of systems, schedu...
Yoshikazu Kamoshida, Kenjiro Taura
IPPS
2007
IEEE
14 years 2 months ago
Incorporating Latency in Heterogeneous Graph Partitioning
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...
Eric E. Aubanel, Xiaochen Wu