Results 261 to 270 of about 3,968 (305)

On Scheduling Coflows

Algorithmica, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang 0005   +3 more
openaire   +1 more source

Analyzing hard-real-time programs for guaranteed schedulability

IEEE Transactions on Software Engineering, 1991
The process of verifying that real-time software will meet its timing constraints, referred to as worst-case schedulability analysis, or simply schedulability analysis, is an essential part of the development of real-time software.
A D Stoyenko, R C Holt
exaly   +2 more sources

Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised [PDF]

Real-Time Systems, 2007
Controller Area Network (CAN) is used extensively in automotive applications, with in excess of 400 million CAN enabled microcontrollers manufactured each year.
Robert I Davis, Alan Burns, Reinder J Bril   +2 more
exaly   +2 more sources

Pre-Scheduling

Real-Time Systems, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weirong Wang, Aloysius K. Mok, Gerhard Fohler   +2 more
openaire   +1 more source

Campaign scheduling

2012 19th International Conference on High Performance Computing, 2012
We study the problem of scheduling in parallel systems with many users. We analyze scenarios with many submissions issued over time by several users. These submissions contain one or more jobs; the set of submissions are organized in successive campaigns.
Pinheiro, Vinicius, Razdca, Krzysztof, Trystram, Denis   +2 more
openaire   +1 more source

The spring scheduling coprocessor: a scheduling accelerator

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999
The spring scheduling coprocessor is a novel very large scale integration (VLSI) accelerator for multiprocessor real-time systems. The coprocessor can be used for static as well as online scheduling. Many different policies and their combinations can be used (e.g., earliest deadline first, highest value first, or resource-oriented policies such as ...
Burleson, W, Ko, J, Niehaus, D, Ramamritham, K, Stankovic, JA, Wallace, G, Weems, C   +6 more
openaire   +2 more sources

Tree scheduling versus sequential scheduling

Proceedings of the 1st Workshop on Critical Automotive applications Robustness & Safety - CARS '10, 2010
We present a new approach of validation for critical real- time applications: the tree based approach. This approach explicitly takes the conditional statements and the semantics contained in the tests into account. We substitute sequential schedules by scheduling trees.
Christian Fotsing, Annie Geniet, Guy Vidal-Naquet   +2 more
openaire   +2 more sources

Research on Schedulability of Partition Scheduling for IMA

2011 Fourth International Symposium on Computational Intelligence and Design, 2011
Integrated modular avionics (IMA) is widely adopted by avionics industry to achieve substantial cost reduction in the development, operation and maintenance of airplanes. To meet recommended real-time and fault-tolerance requirements of IMA software architecture, the operating system (OS) should support spatial and temporal partitioning in order to ...
Ming Wan, Song Tian
openaire   +1 more source

List-Scheduling versus Cluster-Scheduling

IEEE Transactions on Parallel and Distributed Systems, 2018
In scheduling theory and parallel computing practice, programs are often represented as directed acyclic graphs. Finding a makespan-minimising schedule for such a graph on a given number of homogenous processors ( $P|prec,c_{ij}|C_{\max}$ ) is an NP-hard optimisation problem.
Huijun Wang, Oliver Sinnen
openaire   +1 more source

Extension of deterministic scheduling to stochastic scheduling

Bulletin of University of Osaka Prefecture. Series A, Engineering and natural sciences, 1992
Summary: Most of the previous scheduling methods assume that processing times should be deterministically prespecified. Since actual processing times are usually distributed, this paper presents typical stochastic performance measures and discusses their optimal schedules.
Jung, Young-Sik, Nagasawa, Hiroyuki, Nishiyama, Noriyuki   +2 more
openaire   +2 more sources