Sciweavers

99 search results - page 18 / 20
» Online Scheduling with Bounded Migration
Sort
View
IJVR
2008
125views more  IJVR 2008»
13 years 7 months ago
Intelligent Mobile Agents for Large-Scale Collaborative Virtual Environment
The Web3D technologies make it possible to create Collaborative Virtual Environment (CVE) in the popular Internet, thus promoting the popularity of CVE scientific applications to b...
Qingping Lin, Liang Zhang, Sun Ding, Guorui Feng, ...
CCGRID
2010
IEEE
13 years 8 months ago
The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
Sergei Shudler, Lior Amar, Amnon Barak, Ahuva Mu'a...
BIRTHDAY
2009
Springer
13 years 11 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
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
JSA
2007
191views more  JSA 2007»
13 years 7 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....