Sciweavers

579 search results - page 9 / 116
» New efficiency results for makespan cost sharing
Sort
View
MFCS
2009
Springer
14 years 1 months ago
Private Capacities in Mechanism Design
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
ASPLOS
2009
ACM
14 years 8 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
ISCA
2009
IEEE
148views Hardware» more  ISCA 2009»
14 years 2 months ago
Disaggregated memory for expansion and sharing in blade servers
Analysis of technology and application trends reveals a growing imbalance in the peak compute-to-memory-capacity ratio for future servers. At the same time, the fraction contribut...
Kevin T. Lim, Jichuan Chang, Trevor N. Mudge, Part...
PE
2008
Springer
102views Optimization» more  PE 2008»
13 years 7 months ago
Multipoint-to-point lightpaths in all-optical networks: Dimensioning and cost analysis
One of the major concerns in optical networks is the bandwidth underutilization problem. In fact, as WDM technology keeps maturing, there is a bandwidth gap between the transmissi...
Nizar Bouabdallah, Guy Pujolle, Harry G. Perros
ICDCS
1996
IEEE
13 years 11 months ago
Larchant: Persistence by Reachability in Distributed Shared Memory Through Garbage Collection
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This ...
Paulo Ferreira, Marc Shapiro