104 search results - page 12 / 21 » Dependency trees in sub-linear time and bounded memory |
101
Voted
CODES
2007
IEEE
15 years 6 months ago
2007
IEEE
Memory requirements of intellectual property components (IP) in contemporary multi-processor systems-on-chip are increasing. Large high-speed external memories, such as DDR2 SDRAM...
125
click to vote
JTRES
2010
ACM
14 years 11 months ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
116
Voted
PODS
1993
ACM
15 years 3 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
SPAA
1997
ACM
15 years 3 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
115
Voted
SIAMCOMP
2012
13 years 2 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...