104 search results - page 13 / 21 » Dependency trees in sub-linear time and bounded memory |
95
Voted
SPAA
1995
ACM
15 years 3 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
There has been considerable recent interest in the support of transactional memory (TM) in both hardware and software. We present an intermediate approach, in which hardware is us...
121
Voted
CASES
2005
ACM
15 years 1 months ago
2005
ACM
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
143
Voted
RTAS
1996
IEEE
15 years 3 months ago
1996
IEEE
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessa...
119
click to vote
GECCO
2008
Springer
15 years 21 days ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...