Sciweavers

95 search results - page 11 / 19
» Computing the communication costs of item allocation
Sort
View
ASAP
2006
IEEE
97views Hardware» more  ASAP 2006»
15 years 3 months ago
Dynamic-SIMD for lens distortion compensation
An increasing computational demand is placed on the image processing capacity of current and future smart cameras. SIMD processor architectures provide an efficient solution becau...
Bart Mesman, Hamed Fatemi, Henk Corporaal, Twan Ba...
ISPAN
2005
IEEE
15 years 3 months ago
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
Thomas E. Carroll, Daniel Grosu
106
Voted
INFOCOM
2010
IEEE
14 years 7 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
IPPS
2007
IEEE
15 years 3 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
CLOUD
2010
ACM
15 years 2 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...