Sciweavers

1156 search results - page 91 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
JAIR
2008
104views more  JAIR 2008»
13 years 10 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
ICPP
2008
IEEE
14 years 4 months ago
Scalable Dynamic Load Balancing Using UPC
An asynchronous work-stealing implementation of dynamic load balance is implemented using Unified Parallel C (UPC) and evaluated using the Unbalanced Tree Search (UTS) benchmark ...
Stephen Olivier, Jan Prins
ICA3PP
2010
Springer
14 years 3 days ago
Function Units Sharing between Neighbor Cores in CMP
Abstract. Program behaviors reveal that programs have different sources requirement at different phases, even at continuous clocks. It is not a reasonable way to run different prog...
Tianzhou Chen, Jianliang Ma, Hui Yuan, Jingwei Liu...
HPCA
2009
IEEE
14 years 11 months ago
PageNUCA: Selected policies for page-grain locality management in large shared chip-multiprocessor caches
As the last-level on-chip caches in chip-multiprocessors increase in size, the physical locality of on-chip data becomes important for delivering high performance. The non-uniform...
Mainak Chaudhuri
JSSPP
2010
Springer
13 years 8 months ago
Dynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
Thomas Sandholm, Kevin Lai