Sciweavers

IPPS
1998
IEEE
13 years 8 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
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 ...
Torsten Suel
IPPS
1999
IEEE
13 years 8 months ago
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM
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...
Sung-Ryul Kim, Kunsoo Park
SRDS
2000
IEEE
13 years 9 months ago
Deterministic Scheduling for Transactional Multithreaded Replicas
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...
Ricardo Jiménez-Peris, Marta Patiño-...
TAMC
2010
Springer
13 years 9 months ago
Streaming Algorithms for Some Problems in Log-Space
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. ...
Ajesh Babu, Nutan Limaye, Girish Varma
BIRTHDAY
2003
Springer
13 years 9 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
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...
Krishna V. Palem
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
13 years 9 months ago
Bist Reseeding with very few Seeds
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...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
DSN
2003
IEEE
13 years 10 months ago
A Preemptive Deterministic Scheduling Algorithm for Multithreaded Replicas
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K...
STACS
2004
Springer
13 years 10 months ago
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
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...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
ICANN
2005
Springer
13 years 10 months ago
CrySSMEx, a Novel Rule Extractor for Recurrent Neural Networks: Overview and Case Study
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...
Henrik Jacobsson, Tom Ziemke
DSN
2006
IEEE
13 years 10 months ago
CADRE: Cycle-Accurate Deterministic Replay for Hardware Debugging
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...
Smruti R. Sarangi, Brian Greskamp, Josep Torrellas