Sciweavers

1534 search results - page 88 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
JAL
2008
74views more  JAL 2008»
13 years 9 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun
IPPS
2000
IEEE
14 years 1 months ago
Speed vs. Accuracy in Simulation for I/O-Intensive Applications
This paper presents a family of simulators that have been developed for data-intensive applications, and a methodology to select the most efficient one based on a usersupplied req...
Hyeonsang Eom, Jeffrey K. Hollingsworth
PODC
2005
ACM
14 years 2 months ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
RTCSA
2009
IEEE
14 years 3 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
EUROPAR
2008
Springer
13 years 10 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...