Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. P. Berman, C. Coulston, Speed is more powerful than clairvoyance SWAT 98.
2. Using parallel program characteristics in dynamic multiprocessor allocation policies;Brecht;Performance Evaluat.,1996
3. S.H. Chiang, R.K. Mansharamani, M. Vernon, Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies, Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1994, pp. 33–44.
4. X. Deng, P. Dymond, On multiprocessor system scheduling, 7th ACM Symp. on Parallel Architectures and Algorithms, June 1996.
5. X. Deng, N. Gu, T. Brecht, K. Lu, Preemptive scheduling of parallel jobs on multiprocessors, 7th Annual ACM-SIAM Symp. on Discrete Algorithms, Atlanta, Georgia, January 1996, pp. 159–167.
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scheduling Jobs with Work-Inefficient Parallel Solutions;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Randomized Cost Analysis for Non-Clairvoyant Task Offloading in Edge Computing;IEEE Internet of Things Journal;2023
3. Scheduling Group Tests over Time;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26
4. Speed Scaling with Multiple Servers under a Sum-Power Constraint;ACM SIGMETRICS Performance Evaluation Review;2022-03-22
5. Optimal Scheduling of Parallel Jobs With Unknown Service Requirements;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2021