Sciweavers

SPAA
2010
ACM
13 years 9 months ago
Managing the complexity of lookahead for LU factorization with pivoting
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
Ernie Chan, Robert A. van de Geijn, Andrew Chapman
SPAA
2010
ACM
13 years 11 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
SPAA
2010
ACM
13 years 11 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally
SPAA
2010
ACM
13 years 11 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
SPAA
2010
ACM
13 years 11 months ago
Best-effort group service in dynamic networks
d Abstract) Bertrand Ducourthial Sofiane Khalfallah Franck Petit We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as p...
Bertrand Ducourthial, Sofiane Khalfallah, Franck P...
SPAA
2010
ACM
13 years 11 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SPAA
2010
ACM
13 years 11 months ago
Brief announcement: on speculative replication of transactional systems
Paolo Romano, Roberto Palmieri, Francesco Quaglia,...
SPAA
2010
ACM
14 years 3 months ago
Scheduling jobs with varying parallelizability to reduce variance
Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy...