Sciweavers

1617 search results - page 246 / 324
» Parallel Cost Analysis of Distributed Systems
Sort
View
IPPS
2008
IEEE
15 years 5 months ago
On the need for query-centric unstructured peer-to-peer overlays
—Hybrid P2P systems rely on the assumption that sufficient objects exist nearby in order to make the unstructured search component efficient. This availability depends on the o...
William Acosta, Surendar Chandra
JSSPP
2004
Springer
15 years 4 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
PDCAT
2004
Springer
15 years 4 months ago
GridCrypt: High Performance Symmetric Key Cryptography Using Enterprise Grids
Today’s cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an inc...
Agus Setiawan, David Adiutama, Julius Liman, Aksha...
81
Voted
EUROPAR
2006
Springer
15 years 2 months ago
PAM-SoC: A Toolchain for Predicting MPSoC Performance
In the past, research on Multiprocessor Systems-on-Chip (MPSoC) has focused mainly on increasing the available processing power on a chip, while less effort was put into specific s...
Ana Lucia Varbanescu, Henk J. Sips, Arjan J. C. va...
GRID
2007
Springer
14 years 11 months ago
A Tool for Prioritizing DAGMan Jobs and its Evaluation
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...
Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenb...