1074 search results - page 25 / 215 » Parallelizing post-placement timing optimization |
114
click to vote
OPODIS
2010
14 years 7 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
59
Voted
IPPS
1994
IEEE
15 years 1 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
137
click to vote
RTSS
1995
IEEE
15 years 1 months ago
1995
IEEE
A distributed protocol is proposed for the synchronization of real-time tasks that have variable resource requirements. The protocol is simple to implement and is intended for lar...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
101
click to vote
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...