A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Mutual exclusion scheduling
1996
Theoretical Computer Science
Preserved Fulltext
Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G, such that tasks represented by adjacent vertices ...
However, polynomial time is sufficient to produce optimal schedules for forests, and simple heuristics perform well on certain classes of graphs. ...
The problem, which we call MUTUAL EXCLUSION SCHEDULING, is to minimize the makespan, or completion time, of the schedule, subject to the mutual exclusion constraints. ...
doi:10.1016/0304-3975(96)00031-x
fatcat:dx254pdfzbeqrkqfc5gds6v4ne
Process algebra, process scheduling, and mutual exclusion
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The choice of ACP_ϵ stems from the need to cover more process-scheduling policies. We show that a process-scheduling policy supporting mutual exclusion of critical subprocesses is now covered. ...
In the case of multi-threading as found in contemporary programming languages, parallel processes are interleaved according to what is known as a process-scheduling policy in the field of operating systems ...
The adopted mechanism for mutual exclusion is essentially a binary semaphore mechanism [6, 5, 2] . Below binary semaphores are simply called semaphores. ...
arXiv:2003.00473v3
fatcat:rvjlyguajnhifoa64mve74ibmi
Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In scheduling and timetabling applications, the mutual-exclusion constraint stipulates that certain pairs of tasks that cannot be executed at the same time. ...
We present SDP relaxations for a variety of mutual-exclusion scheduling and timetabling problems, starting from a bound on the number of tasks executed within each period, which corresponds to graph colouring ...
Clearly, the work on graph colouring provides a test of infeasibility for timetabling and scheduling problems incorporating the mutual exclusion problem. ...
arXiv:1904.03539v1
fatcat:csewztv5draqhp7zdx5foqtsbq
Scheduling Sporadic Tasks on Multiprocessors with Mutual Exclusion Constraints
2009
2009 International Conference on Parallel Processing Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints. ...
Managing resources that must be accessed under mutual exclusion has always been an important topic in the design of real-time systems because mutual exclusion can cause an extra delay to a task that requests ...
Mechanisms for achieving mutual exclusion interacts with a real-time scheduler however and dealing with those interactions and analyzing those interactions are non-trivial. ...
doi:10.1109/icppw.2009.59
dblp:conf/icppw/EaswaranA09
fatcat:xo5n45ho6rfmfkd2jwj42gikby
The mutual exclusion scheduling problem for permutation and comparability graphs
2003
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider the mutual exclusion scheduling problem for comparability graphs. ...
For each fixed constant m P 6, the problem MUTUAL EXCLUSION SCHEDUL-ING is NP-complete for permutation graphs (and also comparability graphs). ...
Mutual exclusion scheduling These scheduling problems can be solved by creating an undirected graph G ¼ ðV ; EÞ with a vertex for each of the n jobs and an edge between every pair of conflicting jobs. ...
doi:10.1016/s0890-5401(02)00028-7
fatcat:22pi5o5rivf7ffrx66bxc27lhi
The mutual exclusion scheduling problem for permutation and comparability graphs
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider the mutual exclusion scheduling problem for comparability graphs. ...
For each fixed constant m P 6, the problem MUTUAL EXCLUSION SCHEDUL-ING is NP-complete for permutation graphs (and also comparability graphs). ...
Mutual exclusion scheduling These scheduling problems can be solved by creating an undirected graph G ¼ ðV ; EÞ with a vertex for each of the n jobs and an edge between every pair of conflicting jobs. ...
doi:10.1007/bfb0028568
fatcat:h4q5z64d6ndepgueescek6e7cm
Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms
2006
4OR
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Then, the object of the thesis is to study the complexity of mutual exclusion scheduling problem for interval graphs and related classes. ...
The mutual exclusion scheduling problem has an elegant graph-theoretic formulation: given an undirected graph G and an integer k, find a minimum coloring of G such that each color appears at most k times ...
New results on complexity and algorithms First, the complexity of the mutual exclusion scheduling problem for interval graphs is detailed. ...
doi:10.1007/s10288-005-0079-5
fatcat:vi7avg6wx5cpbfpcw5irybfzja
Mutual exclusion scheduling with interval graphs or related classes, Part I
2009
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, the mutual exclusion scheduling problem is addressed. ...
In this way, Baker and Coffman [2] have called Mutual Exclusion Scheduling (shortly MES) the following combinatorial optimization problem:
Mutual Exclusion Scheduling Input: a simple and undirected ...
Consequently, the mutual exclusion scheduling problem is N P -hard too and the quest for a polynomial-time algorithm to solve this problem may be in vain. ...
doi:10.1016/j.dam.2008.04.016
fatcat:d26av5dzqzc6thfhc5l4y5ypla
Mutual exclusion scheduling with interval graphs or related classes. Part II
2008
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper is the second part of a study devoted to the mutual exclusion scheduling problem. ...
called MUTUAL EXCLUSION SCHEDULING (shortly MES) the following problem: MUTUAL EXCLUSION SCHEDULING 1 On leave from the firm Experian-Prologia SAS, Marseille, France. ...
In this paper, the problem is approached from a different point of view by studying a non-trivial and practical sufficient condition for optimality in mutual exclusion scheduling. ...
doi:10.1016/j.dam.2007.08.017
fatcat:qhthu75v4fbpvowcxtux4v2lzm
Simulation-Based Scheduling of Mutually Exclusive Projects with Precedence and Regional Budget Constraints
2012
Transportation Research Record
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
The mutually exclusive alternatives at each location allow us jointly optimize the sizing and timing of improvements. ...
A simulation-based optimization model is developed to solve the problem, which uses simulation to evaluate alternative project schedules. ...
When considering mutually exclusive projects, the GA chromosome contains a full list of mutually exclusive projects. ...
doi:10.3141/2273-01
fatcat:hpjxcfc565atdlf2ximm2r423a
A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints
2006
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
GUS solves an open real-time scheduling problem -scheduling application activities that have time constraints specified using arbitrarily shaped time/utility functions, and have mutual exclusion resource ...
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Scheduling algorithm (which we will refer to simply as GUS). ...
In the context of overload scheduling, little work considers shared resources that have mutual exclusion constraints. ...
doi:10.1109/tc.2006.47
fatcat:qmjupqyxpnbgbeov7vqqtniyci
Self-stabilizing mutual exclusion using unfair distributed scheduler
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
All existing probabilistic self-stabilizing mutual exclusion algorithms designed to work under an unfair distributed scheduler suffer from the following common drawback: Once stabilized, there exists no ...
Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. ...
Strong Probabilistic Stabilizing Mutual Exclusion Specification of the Mutual Exclusion Problem We specify the mutual exclusion problem (SP ME ) as follows: There is exactly one privilege in the system ...
doi:10.1109/ipdps.2000.846023
dblp:conf/ipps/DattaGT00
fatcat:mugfahcu5femraq6uvrd5dx5zm
Combining speculative execution and conditional resource sharing to efficiently schedule conditional behaviors
1999
Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scheduling conditional behaviors necessitates the use of a variety of scheduling optimization techniques like conditional resource sharing and speculative execution. ...
In this paper a list-based scheduling heuristic that exploits conditional resource sharing and speculative execution possibilities, is presented. ...
detected mutual exclusiveness [9] . ...
doi:10.1109/aspdac.1999.760029
dblp:conf/aspdac/KountourisW99
fatcat:lszqbx7afbgrdmz7uijilvlmqe
A system-level approach to hardware reconfigurable systems
2005
Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The proposed design space exploration is based on Evolutionary Algorithms and a new slack-based list scheduler. ...
By doing this, process P2 cannot be scheduled due to the mutually exclusiveness of the configurations. Hence, we cannot schedule processes P3. ...
With these cluster information, a so-called cluster graph g c for mutually exclusive configurations can be constructed. ...
doi:10.1145/1120725.1120853
dblp:conf/aspdac/HaubeltOGT05
fatcat:fso5gos32nfcjp3ix2cqhn5j6i
Evolution of distributed computing theory
2008
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutual exclusion Concurrent processes must coordinate their activities to avoid interference. The mutual exclusion problem is to provide exclusive access to a critical region of code. ...
exclusion problem set the stage for dealing with uncertainty in scheduling. ...
doi:10.1145/1400751.1400858
dblp:conf/podc/Fischer08
fatcat:ospmit6o2jfbnos53f7zvpl4n4
« Previous
Showing results 1 — 15 out of 137,354 results