Author:
Motwani Rajeev,Phillips Steven,Torng Eric
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. A dining philosophers algorithm with polynomial response time;Awerbuch;Proc. 30th ACM Symp. on Foundations of Computers Science,1990
2. New algorithms for an ancient scheduling problem;Bartal;Proc. 24th ACM Symp. on Theory of Computing,1992
3. The drinking philosophers problem;Chandy;ACM TOPLAS,1984
4. A measure of asymptotic efficiency for tests based on the sum of observations;Chernoff;Ann. of Math. Statist.,1952
5. Operating Systems Theory;Coffman,1973
Cited by
149 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Non-clairvoyant Scheduling with Predictions;ACM Transactions on Parallel Computing;2023-12-14
2. Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling;Integer Programming and Combinatorial Optimization;2023
3. Brief Announcement;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
4. Permutation Predictions for Non-Clairvoyant Scheduling;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
5. Non-Clairvoyant Scheduling with Predictions;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06