IPPS
1998
IEEE
14 years 3 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
IPPS
1999
IEEE
14 years 3 months ago
1999
IEEE
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
SRDS
2000
IEEE
14 years 3 months ago
2000
IEEE
One way to implement a fault-tolerant a service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request i...
TAMC
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
BIRTHDAY
2003
Springer
14 years 4 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
VTS
2003
IEEE
14 years 4 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
DSN
2003
IEEE
14 years 4 months ago
2003
IEEE
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
STACS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
ICANN
2005
Springer
14 years 5 months ago
2005
Springer
In this paper, it will be shown that it is feasible to extract finite state machines in a domain of, for rule extraction, previously unencountered complexity. The algorithm used i...
DSN
2006
IEEE
14 years 5 months ago
2006
IEEE
One of the main reasons for the difficulty of hardware verification is that hardware platforms are typically nondeterministic at clock-cycle granularity. Uninitialized state ele...