2498 search results - page 30 / 500 » Data Structures with Unpredictable Timing |
115
click to vote
RTS
2010
14 years 4 months ago
2010
Automatic memory management or garbage collection greatly simplifies development of large systems. However, garbage collection is usually not used in real-time systems due to the u...
80
Voted
MASCOTS
2001
14 years 11 months ago
2001
I/O is a major performance bottleneck in modern computer systems. Modern disks use the Zone-Bit-Recording (ZBR) technology to increase the capacity. A direct consequence of ZBR is...
154
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
100
Voted
PDP
2002
IEEE
15 years 2 months ago
2002
IEEE
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
STACS
2010
Springer
15 years 2 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...