Sciweavers

JPDC
2006
187views more  JPDC 2006»
13 years 11 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
JPDC
2006
156views more  JPDC 2006»
13 years 11 months ago
Grid harvest service: A performance system of grid computing
Conventional performance evaluation mechanisms focus on dedicated systems. Grid computing infrastructure, on the other hand, is a shared collaborative environment constructed on v...
Ming Wu, Xian-He Sun
JPDC
2006
75views more  JPDC 2006»
13 years 11 months ago
Conflict-free star-access in parallel memory systems
Sajal K. Das, Irene Finocchi, Rossella Petreschi
JPDC
2006
104views more  JPDC 2006»
13 years 11 months ago
Performance analysis of different checkpointing and recovery schemes using stochastic model
Several schemes for checkpointing and rollback recovery have been reported in the literature. In this paper, we analyze some of these schemes under a stochastic model. We have der...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya
JPDC
2006
94views more  JPDC 2006»
13 years 11 months ago
Exchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...
Alfredo Goldman, Joseph G. Peters, Denis Trystram
JPDC
2006
100views more  JPDC 2006»
13 years 11 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
JPDC
2006
83views more  JPDC 2006»
13 years 11 months ago
Virtual Leashing: Creating a computational foundation for software protection
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
Ori Dvir, Maurice Herlihy, Nir Shavit
JPDC
2006
93views more  JPDC 2006»
13 years 11 months ago
Fault-tolerant multicasting in hypercubes using local safety information
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
Dong Xiang, Ai Chen, Jia-Guang Sun
JPDC
2006
106views more  JPDC 2006»
13 years 11 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl