Introducing Safety Requirements Traceability Support in Model-Driven Development of Robotic Applications
Requirements traceability is a technique intended to help determine the impact of changes in software design, support their integration, preserve knowledge, and assure the quality and correctness of the overall system. This paper presents an approach ...
Integrated Design-Stage Failure Analysis of Software-Driven Hardware Systems
Software-driven hardware configurations account for the majority of modern safety-critical complex systems. The often costly failures of such systems can be attributed to software specific, hardware specific, or software/hardware interaction failures. ...
Efficient Reachability Analysis for Time Petri Nets
We propose in this paper some efficient approaches, based on the state class graph method, to construct abstractions for the Time Petri Net (TPN) model, suitable to verify its linear or reachability properties. Experimental results have shown that these ...
Efficient, Decentralized Computation of the Topology of Spatial Regions
The capability to query the topology of spatial regions is fundamental to today's centralized spatial computing systems, like spatial databases and GIS. By contrast, this paper explores decentralized algorithms for computing the topology of spatial ...
Redundancy Mining for Soft Error Detection in Multicore Processors
The trends in technology scaling and the reduction in supply voltages have significantly improved the performance and energy consumption in modern microprocessors. Microprocessors are being built with higher degrees of spatial parallelism and deeper ...
RT-PLRU: A New Paging Scheme for Real-Time Execution of Program Codes on NAND Flash Memory for Portable Media Players
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program codes on NAND flash memory, since NAND flash memory only supports page-based reads, not byte-level random reads. This paper ...
A New Placement-Ideal Layout for Multiway Replication Storage System
Technology trends are making sophisticated replication-based storage architectures become a standard commercial practice in today's computing. Existing solutions successfully developed optimal and near-optimal parallelism layouts such as declustered ...
Embedding Meshes and Tori on Double-Loop Networks of the Same Size
Double-loop networks are extensions of ring networks and are widely used in the design and implementation of local area networks and parallel processing architectures. However, embedding of other types of networks on double-loop networks has not been ...
Performance Optimization Based on Analytical Modeling in a Real-Time System with Constrained Time/Utility Functions
We consider a single-processor firm real-time (FRT) system with exponential interarrival and execution times for jobs with relative deadlines following a general distribution. The scheduling policy of the system is first-come first-served (FCFS) and the ...
A Power and Throughput-Efficient Packet Classifier with n Bloom Filters
Packet processing is a critical operation in a high-speed router, and in order for this router to achieve memory efficient and fast {\cal O}(1) lookup operations, Bloom filters (BFs) have been widely used as a packet classifier to reduce expensive hash ...
Implementing End-to-End Register Data-Flow Continuous Self-Test
While Moore's Law predicts the ability of semiconductor industry to engineer smaller and more efficient transistors and circuits, there are serious issues not contemplated in that law. One concern is the verification effort of modern computing systems, ...
Efficient Multi-Input/Multi-Output VLSI Architecture for Two-Dimensional Lifting-Based Discrete Wavelet Transform
This brief paper proposes an efficient multi-input/multi-output VLSI architecture (MIMOA) for two-dimensional lifting-based discrete wavelet transform (DWT). The novelty is the simplicity and generality to construct the MIMOA, which is a high-speed ...
Improved n-Term Karatsuba-Like Formulas in GF(2)
It is well known that Chinese Remainder Theorem (CRT) can be used to construct efficient algorithms for multiplication of polynomials over GF(2). In this note, we show how to select an appropriate set of modulus polynomials to obtain minimal number of ...
