暂无分享,去创建一个
Jian-Jia Chen | Nikhil Bansal | Samarjit Chakraborty | Georg von der Brüggen | N. Bansal | Jian-Jia Chen | G. V. D. Brüggen | S. Chakraborty
[1] Sanjoy K. Baruah,et al. The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems , 2006, IEEE Transactions on Computers.
[2] Jian-Jia Chen,et al. Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks , 2015, 2016 28th Euromicro Conference on Real-Time Systems (ECRTS).
[3] Jian-Jia Chen,et al. Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems , 2012, 2012 24th Euromicro Conference on Real-Time Systems.
[4] Sanjeev Khanna,et al. On Multidimensional Packing Problems , 2004, SIAM J. Comput..
[5] Gerhard J. Woeginger,et al. There is no Asymptotic PTAS for Two-Dimensional Vector Packing , 1997, Inf. Process. Lett..
[6] Kirk Pruhs,et al. Online scheduling , 2003 .
[7] Sanjoy K. Baruah,et al. The partitioned multiprocessor scheduling of sporadic task systems , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).
[8] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .
[9] Sanjoy K. Baruah,et al. Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[10] Jian-Jia Chen,et al. Resource Augmentation Bounds for Approximate Demand Bound Functions , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.
[11] Sang Hyuk Son,et al. New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.
[12] Sanjoy K. Baruah,et al. The Partitioned EDF Scheduling of Sporadic Task Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.
[13] Lin Chen,et al. The Power of Migration in Online Machine Minimization , 2016, SPAA.
[14] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[15] Thomas Rothvoß,et al. A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks , 2010, WAOA.
[16] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[17] Lin Chen,et al. An O(log m)-Competitive Algorithm for Online Machine Minimization , 2015, SODA.
[18] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[19] Wang Yi,et al. Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization , 2015, 2015 IEEE Real-Time Systems Symposium.
[20] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[21] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..
[22] Alan Burns,et al. A survey of hard real-time scheduling for multiprocessor systems , 2011, CSUR.
[23] Wenceslas Fernandez de la Vega,et al. Bin packing can be solved within 1+epsilon in linear time , 1981, Comb..
[24] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[25] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[26] W. Hsu,et al. Packing sporadic real-time tasks on identical multiprocessor systems , 2018 .
[27] Robert I. Davis,et al. On the Pitfalls of Resource Augmentation Factors and Utilization Bounds in Real-Time Scheduling , 2017, ECRTS.
[28] Kirk Pruhs,et al. An O(Log Log m)-Competitive Algorithm for Online Machine Minimization , 2017, 2017 IEEE Real-Time Systems Symposium (RTSS).
[29] Nikhil Bansal,et al. Approximating Real-Time Scheduling on Identical Machines , 2014, LATIN.
[30] Friedrich Eisenbrand,et al. EDF-schedulability of synchronous periodic task systems is coNP-hard , 2010, SODA '10.
[31] Wang Yi,et al. Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete , 2015, 2015 27th Euromicro Conference on Real-Time Systems.
[32] Aloysius Ka-Lau Mok,et al. Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .
[33] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).