Sciweavers

523 search results - page 21 / 105
» On the Signal Bounding Problem in Timing Analysis
Sort
View
175
Voted
POPL
2008
ACM
16 years 15 hour ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
CEC
2007
IEEE
15 years 6 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
NOCS
2008
IEEE
15 years 6 months ago
Real-Time Communication Analysis for On-Chip Networks with Wormhole Switching
Abstract— In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach i...
Zheng Shi, Alan Burns
JEC
2006
113views more  JEC 2006»
14 years 11 months ago
CyNC: A method for real time analysis of systems with cyclic data flows
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
Henrik Schiøler, Jens Dalsgaard Nielsen, Ki...
RTSS
2006
IEEE
15 years 5 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller