The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling with incompatible jobs
Discrete Applied Mathematics
Theoretical Computer Science
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Scheduling with forbidden sets
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Guaranteeing Fair Service to Persistent Dependent Tasks
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Impact of traffic diversion with ATIS on travelers' safety
Computers and Industrial Engineering
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
The interval packing process of linear networks
ACM SIGMETRICS Performance Evaluation Review
On the Complexity of Scheduling Incompatible Jobs with Unit-Times
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Distributed Resource Allocation Algorithms (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
Probability in the Engineering and Informational Sciences
An improved algorithm for the p-center problem on interval graphs with unit lengths
Computers and Operations Research
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
On-line partitioning for on-line scheduling with resource conflicts
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
The p-maxian problem on interval graphs
Discrete Applied Mathematics
Backup 2-center on interval graphs
Theoretical Computer Science
Fundamenta Informaticae
Production scheduling of assembly fixtures in the aeronautical industry
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper, we consider the on-line scheduling of jobs that may be competing for mutually exclusive resources. We model the conflicts between jobs with a conflict graph, so that the set of all concurrently running jobs must form an independent set in the graph. This model is natural and general enough to have applications in a variety of settings; however, we are motivated by the following two specific applications: traffic intersection control and session scheduling in high speed local area networks with spatial reuse. Our results focus on two special classes of graphs motivated by our applications: bipartite graphs and interval graphs. The cost function we use is maximum response time. In all of the upper bounds, we devise algorithms which maintain a set of invariants which bound the accumulation of jobs on cliques (in the case of bipartite graphs, edges) in the graph. The lower bounds show that the invariants maintained by the algorithms are tight to within a constant factor. For a specific graph which arises in the traffic intersection control problem, we show a simple algorithm which achieves the optimal competitive ratio.