Sciweavers

1205 search results - page 76 / 241
» On P Systems with Bounded Parallelism
Sort
View
EUROPAR
2001
Springer
14 years 6 days ago
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes
This paper is on the construction of a server subsystem in a client/server system in an application context where the number of potential clients can be arbitrarily large. The imp...
Paul D. Ezhilchelvan, Jean-Michel Hélary, M...
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
PC
2006
103views Management» more  PC 2006»
13 years 7 months ago
Is MPI suitable for a generative design-pattern system?
Generative parallel design patterns is a proven technique to improve the productivity of parallel program development. However many of the generative design-pattern systems are de...
Paras Mehta, José Nelson Amaral, Duane Szaf...
IPPS
2008
IEEE
14 years 2 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter