Sciweavers

314 search results - page 24 / 63
» Reducing Parallel Overheads Through Dynamic Serialization
Sort
View
PDPTA
2003
13 years 10 months ago
Flexible Approximate String Matching Application on a Heterogeneous Distributed Environment
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICNP
2003
IEEE
14 years 2 months ago
Matchmaker: Signaling for Dynamic Publish/Subscribe Applications
The publish/subscribe (pub/sub) paradigm provides content-oriented data dissemination in which communication channels are established between content publishers and content subscr...
Zihui Ge, Ping Ji, James F. Kurose, Donald F. Tows...
ICPP
1999
IEEE
14 years 1 months ago
Trace-Level Reuse
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
Antonio González, Jordi Tubella, Carlos Mol...
IPPS
1999
IEEE
14 years 1 months ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec
CLUSTER
2011
IEEE
12 years 8 months ago
Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications
—Computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. S...
Esteban Meneses, Laxmikant V. Kalé, Greg Br...