Sciweavers

24 search results - page 4 / 5
» Balanced allocations: the heavily loaded case
Sort
View
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 2 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
ICDCS
2010
IEEE
13 years 7 months ago
Resource Allocation in Distributed Mixed-Criticality Cyber-Physical Systems
—Large-scale distributed cyber-physical systems will have many sensors/actuators (each with local micro-controllers), and a distributed communication/computing backbone with mult...
Karthik Lakshmanan, Dionisio de Niz, Ragunathan Ra...
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
BIRTE
2006
139views Business» more  BIRTE 2006»
13 years 11 months ago
Quality Contracts for Real-Time Enterprises
Real-time enterprises rely on user queries being answered in a timely fashion and using fresh data. This is relatively easy when systems are lightly loaded and both queries and upd...
Alexandros Labrinidis, Huiming Qu, Jie Xu
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
14 years 7 days ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal