Sciweavers

794 search results - page 99 / 159
» Stackelberg scheduling strategies
Sort
View
DAC
2012
ACM
13 years 3 months ago
Equivalence checking for behaviorally synthesized pipelines
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
Kecheng Hao, Sandip Ray, Fei Xie
IWOMP
2009
Springer
15 years 8 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins
IEEEARES
2008
IEEE
15 years 7 months ago
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...
JSSPP
2004
Springer
15 years 6 months ago
Parallel Computer Workload Modeling with Markov Chains
Abstract. In order to evaluate different scheduling strategies for parallel computers, simulations are often executed. As the scheduling quality highly depends on the workload tha...
Baiyi Song, Carsten Ernemann, Ramin Yahyapour
COORDINATION
2006
Springer
15 years 5 months ago
Evolution On-the-Fly with Paradigm
The coordination language Paradigm allows for a flexible and orthogonal modeling of interprocess relationships at the architectural level. It is shown how dynamic system adaptation...
Luuk Groenewegen, Erik P. de Vink