نتایج جستجو برای: preemptive scheduling

تعداد نتایج: 71536  

2014
VISHWAS PATIL OM TIWARI

Wireless sensor networks (WSNs) have a wide variety of military and civil applications. The sensor nodes are powered by batteries with limited energy. Hostile or hazardous environments where the sensor nodes are deployed or the sheer number of the sensors prevents replacement or recharge of the batteries. Therefore in WSNs, scheduling of different types of packets is of vital importance to redu...

Journal: :Proceedings of the ACM on Measurement and Analysis of Computing Systems 2017

2007
Nicole Megow Tjark Vredeveld

We consider the preemptive and non-preemptive problems of scheduling jobs with precedence constraints on parallel machines with the objective to minimize the sum of (weighted) completion times. We investigate an online model in which the scheduler learns about a job when all its predecessors have completed. For scheduling on a single machine, we show matching lower and upper bounds of Θ(n) and ...

2011
Laura Carnevali Giuseppe Lipari Alessandro Pinzuti Enrico Vicario

Hierarchical scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This plays a crucial role in all industrial areas where high-performance microprocessors allow growing integration of multiple applications on a single platfor...

2002
Frank Padberg

We present a scheduling model which is tailored to the dynamics of software projects. In the model, activity times are stochastic, resources are constrained and non-identical, and scheduling is preemptive. As opposed to other stochastic project scheduling models, the completion time of an activity explicitly depends on the amount of feedback received from concurrent activities. As a consequence...

Journal: :J. Embedded Computing 2011
Björn Andersson

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline al...

2000
Manas Saksena Yun Wang

The maturity of schedulabilty analysis techniques for fixed-priority preemptive scheduling has enabled the consideration of timing issues at design time using a specification of the tasking architecture and estimates of execution times for tasks. While successful, this approach has limitations since the preemptive multi-tasking model does not scale well for a large number of tasks, and the fixe...

2001
Hiroyuki Tomiyama Yun Cao Kazuaki Murakami

Many real-world embedded systems employ a preemptive scheduling policy in order to satisfy their realtime requirements. However, most System-Level Design Languages (SLDLs) which were proposed up to now, such as SpecC, do not explicitly support modeling of preemptions. This paper proposes techniques for modeling xed-priority preemptive multi-task systems in the SpecC SLDL. The modeling technique...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید