Sciweavers

TC
1998
13 years 4 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
TC
1998
13 years 4 months ago
Multiple-Valued Signed-Digit Adder Using Negative Differential-Resistance Devices
—This paper describes a new signed-digit full adder (SDFA) circuit consisting of resonant-tunneling diodes (RTDs) and metal-oxide semiconductor field effect transistors (MOSFETs)...
Alejandro F. González, Pinaki Mazumder
TC
1998
13 years 4 months ago
Measuring and Optimizing CORBA Latency and Scalability Over High-Speed Networks
There is increasing demand to extend object-oriented middleware, such as OMG CORBA, to support applications with stringent quality of service (QoS) requirements. However, conventi...
Aniruddha S. Gokhale, Douglas C. Schmidt
TC
1998
13 years 4 months ago
Using System-Level Models to Evaluate I/O Subsystem Designs
—We describe a system-level simulation model and show that it enables accurate predictions of both I/O subsystem and overall system performance. In contrast, the conventional app...
Gregory R. Ganger, Yale N. Patt
TC
1998
13 years 4 months ago
Analysis of Preventive Maintenance in Transactions Based Software Systems
—Preventive maintenance of operational software systems, a novel technique for software fault tolerance, is used specifically to counteract the phenomenon of software “aging.â€...
Sachin Garg, Antonio Puliafito, Miklós Tele...
TC
1998
13 years 4 months ago
A Metaobject Architecture for Fault-Tolerant Distributed Systems: The FRIENDS Approach
—The FRIENDS system developed at LAAS-CNRS is a metalevel architecture providing libraries of metaobjects for fault tolerance, secure communication, and group-based distributed a...
Jean-Charles Fabre, Tanguy Pérennou
TC
1998
13 years 4 months ago
A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
Germain Drolet
TC
1998
13 years 4 months ago
Performance Evaluation and Cost Analysis of Cache Protocol Extensions for Shared-Memory Multiprocessors
—We evaluate three extensions to directory-based cache coherence protocols in shared-memory multiprocessors. These extensions are aimed at reducing the penalties associated with ...
Fredrik Dahlgren, Michel Dubois, Per Stenströ...
TC
1998
13 years 4 months ago
Optimal Zero-Aliasing Space Compaction of Test Responses
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
Krishnendu Chakrabarty, Brian T. Murray, John P. H...