400 search results - page 39 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
113
click to vote
IOPADS
1997
15 years 1 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
AIPS
2009
15 years 28 days ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
ATS
2001
IEEE
15 years 3 months ago
2001
IEEE
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. ...