Results 221 to 230 of about 157,519 (269)
Some of the next articles are maybe not open access.
The spring scheduling coprocessor: a scheduling accelerator
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1999The 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 +6 more
openaire +2 more sources
On Schedulability Bounds of Static Priority Schedulers
11th IEEE Real Time and Embedded Technology and Applications Symposium, 2005While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this paper, we develop a general framework that allows one to effectively derive schedulability bounds for a wide range of ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao 0001
openaire +1 more source
Tree scheduling versus sequential scheduling
Proceedings of the 1st Workshop on Critical Automotive applications Robustness & Safety - CARS '10, 2010We 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 +2 more
openaire +2 more sources
Insertion scheduling: An alternative to list scheduling for modulo schedulers
1996The list scheduling algorithm is a popular scheduling engine used in most, if not all, industrial instruction schedulers. However this technique has several drawbacks, especially in the context of modulo scheduling. One such problem is the need to restart scheduling from scratch whenever scheduling fails at the current value of the initiation interval.
openaire +1 more source
Research on Schedulability of Partition Scheduling for IMA
2011 Fourth International Symposium on Computational Intelligence and Design, 2011Integrated 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, 2018In 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, 1992Summary: 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 +2 more
openaire +2 more sources
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers, 1986The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its
Jacek Blazewicz +2 more
openaire +2 more sources
Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler
2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, 2011Energy efficiency of data centers has draw a great attention due to the cost of power consumption increases dramatically as the size of data center grows. Nowadays, Map Reduce is a framework widely used for processing large data sets in data center, its energy efficiency directly affects the energy efficiency of data center.
Tao Zhu, Chengchun Shu, Haiyan Yu
openaire +1 more source
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
A pattern is a sequence of disjoint intervals on a circle together with fixed distances between these intervals. The intervals may be interpreted as tasks of a job which is produced periodically on one machine. The problem consists in moving r patterns relative to each other to minimize the maximum overlapping of intervals (machines needed).
Peter Brucker, Ulrich Kathmann
openaire +1 more source
A pattern is a sequence of disjoint intervals on a circle together with fixed distances between these intervals. The intervals may be interpreted as tasks of a job which is produced periodically on one machine. The problem consists in moving r patterns relative to each other to minimize the maximum overlapping of intervals (machines needed).
Peter Brucker, Ulrich Kathmann
openaire +1 more source