Sciweavers

1192 search results - page 120 / 239
» Computing Weakest Readings
Sort
View
EUROPAR
2001
Springer
15 years 8 months ago
Optimal Polling for Latency-Throughput Tradeoffs in Queue-Based Network Interfaces for Clusters
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...
Dmitry Ponomarev, Kanad Ghose, Eugeny Saksonov
VTS
1999
IEEE
125views Hardware» more  VTS 1999»
15 years 7 months ago
Error Detecting Refreshment for Embedded DRAMs
This paper presents a new technique for on-line consistency checking of embedded DRAMs. The basic idea is to use the periodic refresh operation for concurrently computing a test c...
Sybille Hellebrand, Hans-Joachim Wunderlich, Alexa...
95
Voted
IFIP
1999
Springer
15 years 7 months ago
A Synthesis Algorithm for Modular Design of Pipelined Circuits
: This paper presents a synthesis algorithm for pipelined circuits. The circuit is specified as a collection of independent, looselycoupled modules connected by queues. The synthe...
Maria-Cristina V. Marinescu, Martin C. Rinard
ICCL
1992
IEEE
15 years 7 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
ESAS
2007
Springer
15 years 7 months ago
The Candidate Key Protocol for Generating Secret Shared Keys from Similar Sensor Data Streams
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independ...
Rene Mayrhofer