Sciweavers

3256 search results - page 586 / 652
» Mixin-Based Programming in C
Sort
View
LCPC
2000
Springer
13 years 11 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
LCTRTS
2000
Springer
13 years 11 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
ASPLOS
2010
ACM
13 years 10 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
USENIX
2008
13 years 10 months ago
Fast, Inexpensive Content-Addressed Storage in Foundation
Foundation is a preservation system for users' personal, digital artifacts. Foundation preserves all of a user's data and its dependencies--fonts, programs, plugins, ker...
Sean C. Rhea, Russ Cox, Alex Pesterev
ASPLOS
2008
ACM
13 years 9 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...