Sciweavers

1415 search results - page 173 / 283
» Can Parallel Algorithms Enhance Serial Implementation
Sort
View
PODC
2003
ACM
14 years 3 months ago
Scalable and dynamic quorum systems
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
Moni Naor, Udi Wieder
IPPS
1998
IEEE
14 years 2 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
ICALP
2010
Springer
14 years 5 days ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
GCC
2007
Springer
14 years 4 months ago
Improving the Performance of MPI Applications over Computational Grid
The Message Passing Interface (MPI) is a standard in parallel computing, and can also be used as a highperformance programming model for Grid application development. How to execu...
Bo Song, Guangwen Yang, Qiming Fang
ICDCS
2007
IEEE
14 years 4 months ago
Temporal Privacy in Wireless Sensor Networks
Although the content of sensor messages describing “events of interest” may be encrypted to provide confidentiality, the context surrounding these events may also be sensitiv...
Pandurang Kamat, Wenyuan Xu, Wade Trappe, Yanyong ...