๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Time/Contention Trade-Offs for Multiprocessor Synchronization

โœ Scribed by James H. Anderson; Jae-Heon Yang

Book ID
112252199
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
641 KB
Volume
124
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Predictable synchronization mechanisms f
Predictable synchronization mechanisms for multiprocessor real-time systems
โœ Lory D. Molesky; Chia Shen; Goran Zlokapa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer US ๐ŸŒ English โš– 1003 KB

Predictability is of paramount concern for hard real-time systems. In one approach to predictability, every aspect of a real-time system and every primitive provided by the underlying operating system must be bounded and predictable in order to achieve overall predictability. In this paper, we descr

Time-space trade-offs for compressed suf
Time-space trade-offs for compressed suffix arrays
โœ S.Srinivasa Rao ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed