Executing computing tasks with replications is an essential choice to achieve fault-tolerance in designing real-time, embedded systems. A problem of maximizing the number of real-time tasks with replications running on a multiprocessor embedded system is discussed in this letter. The partitioning problem can be modeled as a variant of the bin-packing problem. In the original problem, it is known that the first-fit (FF) method has a good worst-case performance bound of 4/3. Whether or not the same bound is achievable in the variant problem remains an open question. This letter closes the question by proving that the worst-case performance bound of using the FF method approaches to 2 but it never reaches it. Then, a tight bound of asymptotic worst-case performance is shown.
With the advanced technology used to design VLSI (Very Large Scale Integration) circuits, low-power and energy-efficiency have played important roles for hardware and software implementation. Real-time scheduling is one of the fields that has attracted extensive attention to design low-power, embedded/real-time systems. The dynamic voltage scaling (DVS) and CPU shut-down are the two most popular techniques used to design the algorithms. In this paper, we firstly review the fundamental advances in the research of energy-efficient, real-time scheduling. Then, a unified framework with a real Intel PXA255 Xscale processor, namely real-energy, is designed, which can be used to measure the real performance of the algorithms. We conduct a case study to evaluate several classical algorithms by using the framework. The energy efficiency and the quantitative difference in their performance, as well as the practical issues found in the implementation of these algorithms are discussed. Our experiments show a gap between the theoretical and real results. Our framework not only gives researchers a tool to evaluate their system designs, but also helps them to bridge this gap in their future works.
10 October 2016 in International Journal of Parallel, Emergent and Distributed Systems
Today, many critical information systems have safety-critical and non-safety-critical functions executed on the same platform in order to reduce design and implementation costs. The set of safety-critical functionality is subject to certification requirements and the rest of the functionality does not need to be certified, or is certified to a lower level. The resulting mixed-criticality systems bring challenges in designing such systems, especially when the critical tasks are required to complete with a timing constraint. This paper studies a problem of scheduling a mixed-criticality system with fault tolerance. A fault-recovery technique called checkpointing is used where a program can go back to a recent checkpoint for re-execution upon errors occurred. A novel schedulability test is derived to ensure that the safety-critical tasks are completed before their deadlines and the theoretical correctness is shown.
1 May 2019 in Journal of International Technology and Information Management
This article discusses generic scripting, a useful scripting technology for developing applications. In its simplest use, generic scripting can be used as a documentation tool to replace flowcharting or pseudocode. in certain situations, generic scripting can lead directly to a working application without the need to write, compile and test a new program. Generic scripting is discussed as a tool which can be used in logical design, detailed design and implementation of a new application. An example is presented to show how generic scripting can be used by non-programmers to simplify the development of applications. This example is used to teach business processes at the authors’ university.