104 search results - page 13 / 21 » Dependency trees in sub-linear time and bounded memory |
SPAA
1995
ACM
14 years 10 days 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
14 years 3 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...
CASES
2005
ACM
13 years 10 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 ...
RTAS
1996
IEEE
14 years 29 days 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...
GECCO
2008
Springer
13 years 10 months 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...