Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2021
Generalized Mixed-Criticality Static Scheduling for Periodic Directed Acyclic Graphs on Multi-Core Processors
IEEE Transactions on Computers (ITCO), Volume 70, Issue 3Pages 457–470https://doi.org/10.1109/TC.2020.2990229In safety-critical systems many software components of different criticalities or assurance levels need to interact in a timely manner to keep the system and environment safe. Nowadays, these systems are challenged by technological progress resulting in ...
- research-articleJune 2019
The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling
IEEE Transactions on Computers (ITCO), Volume 68, Issue 6Pages 926–938https://doi.org/10.1109/TC.2018.2878835In the design optimization of real-time systems scheduled with fixed priority, schedulability analysis is used to define the feasibility region within which tasks meet their deadlines, so that optimization algorithms can find the best solution within ...
- research-articleJuly 2017
Deadline and Period Assignment for Update Transactions in Co-Scheduling Environment
IEEE Transactions on Computers (ITCO), Volume 66, Issue 7Pages 1119–1131https://doi.org/10.1109/TC.2016.2645205Deriving deadline and period for update transactions to maintain temporal consistency has long been recognized as an important problem in real-time database research. Despite years of active study, most of the past work only focuses on the scheduling of ...
- research-articleMarch 2017
Schedulability Analysis for Real-Time Task Set on Resource with Performance Degradation and Dual-Level Periodic Rejuvenations
IEEE Transactions on Computers (ITCO), Volume 66, Issue 3Pages 553–559https://doi.org/10.1109/TC.2016.2602833Researches in real-time scheduling often assume that the performance of a computing resource does not change over time. However, as system softwares and system architectures become increasingly complex, resource performance degradation over time becomes ...
- research-articleJanuary 2017
Adaptive Scheduling of Task Graphs with Dynamic Resilience
IEEE Transactions on Computers (ITCO), Volume 66, Issue 1Pages 17–23https://doi.org/10.1109/TC.2016.2574349This paper studies a scheduling problem of task graphs on a non-dedicated networked computing platform. The networked platform is characterized by a set of fully connected processors such as a multiprocessor system that can be shared by multiple tasks. ...
-
- articleMay 2016
Transparent Real-Time Task Scheduling on Temporal Resource Partitions
IEEE Transactions on Computers (ITCO), Volume 65, Issue 5Pages 1646–1655https://doi.org/10.1109/TC.2015.2449857The Hierarchical Real-Time Scheduling (HiRTS) technique helps improve overall resource utilization in real-time embedded systems. With HiRTS, a computation resource is divided into a group of temporal resource partitions, each of which accommodates ...
- research-articleNovember 2015
Scheduling Divisible Loads in Gaussian, Mesh and Torus Network of Processors
IEEE Transactions on Computers (ITCO), Volume 64, Issue 11Pages 3249–3264https://doi.org/10.1109/TC.2015.2389843In this paper, we propose a novel analysis method for divisible load scheduling in mesh, torus and Gaussian network, a new type of interconnection network that has the same node degree as the mesh and torus, but shorter network diameter and shorter ...
- research-articleJune 2015
On the Interplay between Global DVFS and Scheduling Tasks with Precedence Constraints
IEEE Transactions on Computers (ITCO), Volume 64, Issue 6Pages 1742–1754https://doi.org/10.1109/TC.2014.2345410Many multicore processors are capable of decreasing the voltage and clock frequency to save energy at the cost of an increased delay. While a large part of the theory oriented literature focuses on local dynamic voltage and frequency scaling (local DVFS), ...
- research-articleJune 2015
A Nearly Optimal Packet Scheduling Algorithm for Input Queued Switches with Deadline Guarantees
IEEE Transactions on Computers (ITCO), Volume 64, Issue 6Pages 1548–1563https://doi.org/10.1109/TC.2014.2329695Deadline guaranteed packet scheduling for switches is a fundamental issue for providing guaranteed QoS in digital networks. It is a historically difficult NP-hard problem if three or more deadlines are involved. All existing algorithms have too low ...
- research-articleMay 2015
End-to-End Communication Delay Analysis in Industrial Wireless Networks
IEEE Transactions on Computers (ITCO), Volume 64, Issue 5Pages 1361–1374https://doi.org/10.1109/TC.2014.2322609WirelessHART is a new standard specifically designed for real-time and reliable communication between sensor and actuator devices for industrial process monitoring and control applications. End-to-end communication delay analysis for WirelessHART networks ...
- research-articleOctober 2014
Path-Dividing Based Scheduling Algorithm for Reducing Energy Consumption of Clustered VLIW Architectures
IEEE Transactions on Computers (ITCO), Volume 63, Issue 10Pages 2526–2539https://doi.org/10.1109/TC.2013.138This paper presents an instruction scheduling algorithm for clustered very long instruction words (VLIW) architectures. It exploits a path-dividing-based technique to decide a more appropriate processing order of instructions, and utilizes a more global ...
- research-articleMay 2014
An Efficient Test Method for Rate Monotonic Schedulability
IEEE Transactions on Computers (ITCO), Volume 63, Issue 5Pages 1309–1315https://doi.org/10.1109/TC.2012.296Rate Monotonic scheduling algorithm has been widely used in real-time systems for its optimality in fixed priority scheduling. Determining the Rate Monotonic schedulability of tasks is an important problem when designing a real-time system. There are ...
- research-articleMay 2014
Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems
IEEE Transactions on Computers (ITCO), Volume 63, Issue 5Pages 1197–1206https://doi.org/10.1109/TC.2012.279The earliest-deadline-first (EDF) policy has been widely studied for the scheduling of real-time jobs for its effectiveness and simplicity. However, since each preemption incurs an additional delay to the execution of jobs, the effectiveness of EDF is ...
- research-articleApril 2014
Schedulability Analysis of DeferrableScheduling Algorithms for MaintainingReal-Time Data Freshness
IEEE Transactions on Computers (ITCO), Volume 63, Issue 4Pages 979–994https://doi.org/10.1109/TC.2012.266Although the deferrable scheduling algorithm for fixed priority transactions ( DS-FP) has been shown to provide a better performance compared with the More-Less (ML) method, there is still a lack of any comprehensive studies on the necessary and ...
- research-articleOctober 2013
Quality-Driven Dynamic Scheduling for Real-Time Adaptive Applications on Multiprocessor Systems
IEEE Transactions on Computers (ITCO), Volume 62, Issue 10Pages 2026–2040https://doi.org/10.1109/TC.2012.194While quality-adaptable applications are gaining increased popularity on embedded systems (especially multimedia applications), efficient scheduling techniques are necessary to explore this feature to achieve the optimal quality output. In addition to ...
- research-articleOctober 2013
High-Speed Multicast Scheduling in Hybrid Optical Packet Switches with Guaranteed Latency
IEEE Transactions on Computers (ITCO), Volume 62, Issue 10Pages 1972–1987https://doi.org/10.1109/TC.2012.125In this paper, we study multicast scheduling in the OpCut switch, a recently proposed hybrid optical/electronic switching architecture for transmitting high-volume traffic in core networks and parallel computers. First, we present a multicast scheduling ...
- research-articleSeptember 2013
Real-Time Query Scheduling for Wireless Sensor Networks
IEEE Transactions on Computers (ITCO), Volume 62, Issue 9Pages 1850–1865https://doi.org/10.1109/TC.2012.172Recent years have seen the emergence of wireless cyber-physical systems that must support real-time queries of physical environments through wireless sensor networks. This paper proposes Real-Time Query Scheduling (RTQS), a novel approach to conflict-...
- research-articleJune 2013
Complexity Analysis of Checkpoint Scheduling with Variable Costs
IEEE Transactions on Computers (ITCO), Volume 62, Issue 6Pages 1269–1275https://doi.org/10.1109/TC.2012.57The parallel computing platforms available today are increasingly larger and thus, more and more subject to failures. Consequently it is necessary to develop efficient strategies providing safe and reliable completion for HPC parallel applications. ...
- research-articleMay 2013
Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments
IEEE Transactions on Computers (ITCO), Volume 62, Issue 5Pages 1044–1050https://doi.org/10.1109/TC.2012.30The present paper proposes a generalization of the square root rule for optimal periodic scheduling. The rule defines a ratio of item occurrences in a schedule, which minimizes the mean serving time. However, the actual number of each item's occurrences ...
- research-articleJanuary 2013
Robust Scheduling of Task Graphs under Execution Time Uncertainty
IEEE Transactions on Computers (ITCO), Volume 62, Issue 1Pages 98–111https://doi.org/10.1109/TC.2011.203Effective multicore computing requires to make efficient usage of the computational resources on a chip. Offline mapping and scheduling can be applied to improve the performance, but classical approaches require considerable a priori knowledge of the ...