Sciweavers

CONCUR
2010
Springer
13 years 7 months ago
Reversing Higher-Order Pi
Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard...
CONCUR
2010
Springer
13 years 7 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
HPDC
2010
IEEE
13 years 7 months ago
A GPU accelerated storage system
Massively multicore processors, like, for example, Graphics Processing Units (GPUs), provide, at a comparable price, a one order of magnitude higher peak performance than traditio...
Abdullah Gharaibeh, Samer Al-Kiswany, Sathish Gopa...
CONCUR
2010
Springer
13 years 7 months ago
Trust in Anonymity Networks
Anonymity is a security property of paramount importance, as we move steadily towards a wired, online community. Its import touches upon subjects as different as eGovernance, eBusi...
Vladimiro Sassone, Sardaouna Hamadou, Mu Yang
CONCUR
2010
Springer
13 years 7 months ago
On the Compositionality of Round Abstraction
ompositionality of Round Abstraction Abstract Dan R. Ghica and Mohamed N. Menaa University of Birmingham, U.K. We revisit a technique called round abstraction as a solution to the ...
Dan R. Ghica, Mohamed N. Menaa
SPAA
2010
ACM
13 years 7 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 7 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 7 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 7 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...