Sciweavers

738 search results - page 140 / 148
» Cache modeling in probabilistic execution time analysis
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 9 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
GROUP
2009
ACM
14 years 3 months ago
Lazy scheduling of processing and transmission tasks in collaborative systems
A collaborative system must perform both processing and transmission tasks. We present a policy for scheduling these tasks on a single core that is inspired by studies of human pe...
Sasa Junuzovic, Prasun Dewan
KBSE
2008
IEEE
14 years 3 months ago
Random Test Run Length and Effectiveness
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear wheth...
James H. Andrews, Alex Groce, Melissa Weston, Ru-G...
ASIASIM
2004
Springer
14 years 2 months ago
Design and Implementation of an SSL Component Based on CBD
Abstract. SSL is one of the most popular protocols used on the Internet for secure communications. However SSL protocol has several problems. First, SSL protocol brings considerabl...
Eun-Ae Cho, Young-Gab Kim, Chang-Joo Moon, Doo-Kwo...
CODES
2003
IEEE
14 years 1 months ago
Schedule-aware performance estimation of communication architecture for efficient design space exploration
In this paper, we are concerned about the performance estimation of bus-based architectures assuming that the task partitioning on the processing components is already determined....
Sungchan Kim, Chaeseok Im, Soonhoi Ha