Sciweavers

286 search results - page 33 / 58
» Reducing Overheads of Local Communications in Fine-grain Par...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Structural and algorithmic issues of dynamic protocol update
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel ...
Olivier Rütti, Pawel T. Wojciechowski, Andr&e...
IPPS
2007
IEEE
14 years 1 months ago
Proxy-based Grid Information Dissemination
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
GRID
2008
Springer
13 years 8 months ago
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...
Marco Aurélio Stelmar Netto, Rajkumar Buyya
MICRO
2010
IEEE
156views Hardware» more  MICRO 2010»
13 years 6 months ago
Explicit Communication and Synchronization in SARC
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...
Manolis Katevenis, Vassilis Papaefstathiou, Stamat...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 13 hour ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...