نتایج جستجو برای: preemption

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

Journal: :Michigan Journal of Environmental & Administrative Law 2020

Journal: :Journal of Mathematics and Computer Science 2011

Journal: :J. Inf. Sci. Eng. 2018
Saehwa Kim

This paper proposes an efficient priority assignment algorithm for fixed priority preemption threshold scheduling (PTS), which we named FAST-TRAVERSE. It is optimal in the sense that it always finds a feasible priority assignment if one exists. While there are existing optimal algorithms, they are inefficient to be used in practice. The key ideas of FAST-TRAVERSE are to prune sibling traverses ...

2004
Jan Staschulat Rolf Ernst

Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behaviour or they assume simplified preemption and execution scenarios that seriously impact analysis precision. We present an analysis approach for m-way associative caches which considers multiple executions of processes and preemption scenari...

2013
Katherine Coons Madanlal Musuvathi Kathryn McKinley

Definition 1.6. Preemption-bound persistent sets. A set T ⊆ T of transitions enabled in a state s = final(S) is preemption-bound persistent in s iff for all nonempty sequences α of transitions from s in AG(Pb,c) such that ∀i ∈ dom(α), αi 6∈ T and for all t ∈ T , 1. Pb(S.t) ≤ Pb(S.α1) 2. if Pb(S.t) < Pb(S.α1), then t↔ last(α) and t↔ next(final(S.α), last(α).tid) 3. if Pb(S.t) = Pb(S.α1), then ex...

2010
Thomas Ball Sebastian Burckhardt Katherine E. Coons Madan Musuvathi Shaz Qadeer

The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks, and deadlocks. We present a scheduling strategy called preemption sealing that controls where and when a scheduler is disabled from preempting threads during program execution. We demonstrate that this strategy is ef...

2001
Peter Brucker Johann Hurink Sigrid Knust

A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ Cj is minimized. It is shown that the problem can be solved in O(n2) time if no preemption is allowed. Furthermore...

Journal: :Annals of health law 2004
Leatrice Berman-Sandler

Author Leatrice Berman-Sandler reports on independent medical review (IMR), a state-based statutory remedy used to resolve disputes over coverage between patients and their health plans. Ms. Berman-Sandler explores the connection between ERISA preemption and IMR, and opines that in light of recent Supreme Court decisions, the stage has been set for expansion of IMR. Accordingly, Ms. Berman-Sand...

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

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