Sciweavers

1534 search results - page 38 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
RTAS
2009
IEEE
14 years 2 months ago
Partial Program Admission
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
Michael Wilson, Ron Cytron, Jonathan S. Turner
PODC
2011
ACM
12 years 10 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
ISORC
2007
IEEE
14 years 2 months ago
Time-Predictable Task Preemption for Real-Time Systems with Direct-Mapped Instruction Cache
Modern processors used in embedded systems are becoming increasingly powerful, having features like caches and pipelines to speedup execution. While execution speed of embedded so...
Raimund Kirner, Peter P. Puschner
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 1 months ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang
GPC
2007
Springer
14 years 1 months ago
Server-Side Parallel Data Reduction and Analysis
Abstract. Geoscience analysis is currently limited by cumbersome access and manipulation of large datasets from remote sources. Due to their data-heavy and compute-light nature, th...
Daniel L. Wang, Charles S. Zender, Stephen F. Jenk...