Sciweavers

108 search results - page 11 / 22
» A Lower Bound for Dynamic Scheduling of Data Parallel Progra...
Sort
View
ICS
2007
Tsinghua U.
14 years 1 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
DATE
2010
IEEE
183views Hardware» more  DATE 2010»
14 years 17 days ago
Multithreaded code from synchronous programs: Extracting independent threads for OpenMP
—Synchronous languages offer a deterministic model of concurrency at the level of actions. However, essentially all compilers for synchronous languages compile these actions into...
Daniel Baudisch, Jens Brandt, Klaus Schneider
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
ICS
2000
Tsinghua U.
13 years 11 months ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee