Sciweavers

166 search results - page 17 / 34
» Efficient worst case timing analysis of data caching
Sort
View
TKDE
2008
178views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
SSDBM
2000
IEEE
149views Database» more  SSDBM 2000»
14 years 12 hour ago
Coordinating Simultaneous Caching of File Bundles from Tertiary Storage
In a previous paper [Shoshani et al 99], we described a system called STACS (Storage Access Coordination System) for High Energy and Physics (HEP) experiments. These experiments g...
Arie Shoshani, Alex Sim, Luis M. Bernardo, Henrik ...
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 7 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
ITC
2000
IEEE
101views Hardware» more  ITC 2000»
14 years 16 hour ago
Deterministic partitioning techniques for fault diagnosis in scan-based BIST
A deterministic partitioning technique for fault diagnosis in Scan-Based BIST is proposed. Properties of high quality partitions for improved fault diagnosis times are identified...
Ismet Bayraktaroglu, Alex Orailoglu
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...