
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yuxiong He, WenJing Hsu, Charles E. Leiserson, "Provably Efficient Online Nonclairvoyant Adaptive Scheduling," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 9, pp. 12631279, September, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2008.39, author = {Yuxiong He and WenJing Hsu and Charles E. Leiserson}, title = {Provably Efficient Online Nonclairvoyant Adaptive Scheduling}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {9}, issn = {10459219}, year = {2008}, pages = {12631279}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.39}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Provably Efficient Online Nonclairvoyant Adaptive Scheduling IS  9 SN  10459219 SP1263 EP1279 EPD  12631279 A1  Yuxiong He, A1  WenJing Hsu, A1  Charles E. Leiserson, PY  2008 KW  Scheduling and task partitioning KW  Multiple Data Stream Architectures (Multiprocessors) KW  General VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] K. Agrawal, Y. He, W.J. Hsu, and C.E. Leiserson, “Adaptive Task Scheduling with Parallelism Feedback,” Proc. 11th ACM Symp. Principles and Practice of Parallel Programming (PPoPP '06), pp. 100109, 2006.
[2] K. Agrawal, Y. He, and C.E. Leiserson, “An Empirical Evaluation of Work Stealing with Parallelism Feedback,” Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '06), pp. 1929, 2006.
[3] K. Agrawal, Y. He, and C.E. Leiserson, “Work Stealing with Parallelism Feedback,” Proc. 12th ACM Symp. Principles and Practice of Parallel Programming (PPoPP), 2007.
[4] N.S. Arora, R.D. Blumofe, and C.G. Plaxton, “Thread Scheduling for Multiprogrammed Multiprocessors,” Proc. 10th ACM Symp. Parallel Algorithms and Architectures (SPAA '98), pp. 119129, 1998.
[5] N. Avrahami and Y. Azar, “Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching,” Proc. 15thACM Symp. Parallel Algorithms and Architectures (SPAA '03), pp. 1118, 2003.
[6] L. Becchetti and S. Leonardi, “Nonclairvoyant Scheduling to Minimize the Total Flow Time on Single and Parallel Machines,” J. ACM, vol. 51, no. 4, pp. 517539, 2004.
[7] G.E. Blelloch and J. Greiner, “A Provable Time and Space Efficient Implementation of NESL,” Proc. ACM Int'l Conf. Functional Programming (ICFP '96), pp. 213225, 1996.
[8] R.D. Blumofe and C.E. Leiserson, “Scheduling Multithreaded Computations by Work Stealing,” J. ACM, vol. 46, no. 5, pp. 720748, 1999.
[9] T. Brecht, X. Deng, and N. Gu, “Competitive Dynamic Multiprocessor Allocation for Parallel Applications,” Proc. Seventh IEEE Symp. Parallel and Distributed Processing (SPDP '95), pp. 448455, 1995.
[10] F.W. Burton and M.R. Sleep, “Executing Functional Programs on a Virtual Tree of Processors,” Proc. Conf. Functional Programming Languages and Computer Architecture (FPCA '81), pp. 187194, 1981.
[11] J. Chen and A. Miranda, “A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract),” Proc. 31st Ann. ACM Symp. Theory of Computing (STOC '99), pp. 418427, 1999.
[12] S.H. Chiang and M.K. Vernon, “Dynamic vs. Static QuantumBased Parallel Processor Allocation,” Proc. Second Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '96), pp. 200223, 1996.
[13] W. Cirne and F. Berman, A Model for Moldable Supercomputer Jobs, p. 59, 2001.
[14] X. Deng and P. Dymond, “On Multiprocessor System Scheduling,” Proc. Eighth ACM Symp. Parallel Algorithms and Architectures (SPAA '96), pp. 8288, 1996.
[15] X. Deng, N. Gu, T. Brecht, and K.C. Lu, “Preemptive Scheduling of Parallel Jobs on Multiprocessors,” Proc. Seventh Ann. ACMSIAM Symp. Discete Algorithms (SODA '96), pp. 159167, 1996.
[16] DESMOJ: A Framework for DiscreteEvent Modelling and Simulation, http://asiwww.informatik.unihamburg.de desmoj/, 2008.
[17] J. Edmonds, “Scheduling in the Dark,” Proc. 31st Ann. ACM Symp. Theory of Computing (STOC '99), pp. 179188, 1999.
[18] J. Edmonds, D.D. Chinn, T. Brecht, and X. Deng, “NonClairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics,” J. Scheduling, vol. 6, no. 3, pp. 231250, 2003.
[19] D.G. Feitelson, “Packing Schemes for Gang Scheduling,” Proc. Second Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '96), pp. 89110, 1996.
[20] D.G. Feitelson, Job Scheduling in Multiprogrammed Parallel Systems (Extended Version), IBM Research Report RC 19790 (87657), secondrevision, 1997.
[21] R.L. Graham, “Bounds on Multiprocessing Anomalies,” SIAM J.Applied Math., vol. 17, no. 2, pp. 416429, 1969.
[22] N. Gu, “Competitive Analysis of Dynamic Processor Allocation Strategies,” master's thesis, York Univ., 1995.
[23] R.H. Halstead Jr., “Implementation of Multilisp: LISP on a Multiprocessor,” Proc. ACM Symp. Lisp and Functional Programming (LFP '84), pp. 917, Aug. 1984.
[24] M. HarcholBalter, “The Effect of HeavyTailed Job Size. Distributions on Computer System Design,” Proc. Conf. Applications of Heavy Tailed Distributions in Economics, 1999.
[25] M. HarcholBalter and A.B. Downey, “Exploiting Process Lifetime Distributions for Dynamic Load Balancing,” ACM Trans. Computer Systems, vol. 15, no. 3, pp. 253285, 1997.
[26] K. Jansen and H. Zhang, “Scheduling Malleable Tasks with Precedence Constraints,” Proc. 17th ACM Symp. Parallel Algorithms and Architectures (SPAA '05), pp. 8695, 2005.
[27] B. Kalyanasundaram and K.R. Pruhs, “Minimizing Flow Time Nonclairvoyantly,” J. ACM, vol. 50, no. 4, pp. 551567, 2003.
[28] U. Lublin and D.G. Feitelson, “The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs,” J. Parallel and Distributed Computing, vol. 63, no. 11, pp. 11051122, 2003.
[29] S. Lucco, “A Dynamic Scheduling Method for Irregular Parallel Programs,” Proc. ACM Conf. Programming Language Design and Implementation (PLDI '92), pp. 200211, 1992.
[30] C. McCann, R. Vaswani, and J. Zahorjan, “A Dynamic Processor Allocation Policy for Multiprogrammed SharedMemory Multiprocessors,” ACM Trans. Computer Systems, vol. 11, no. 2, pp. 146178, 1993.
[31] R. Motwani, S. Phillips, and E. Torng, “NonClairvoyant Scheduling,” Proc. Fourth Ann. ACMSIAM Symp. Discete Algorithms (SODA '93), pp. 422431, 1993.
[32] G.J. Narlikar and G.E. Blelloch, “SpaceEfficient Scheduling of Nested Parallelism,” ACM Trans. Programming Languages and Systems, vol. 21, no. 1, pp. 138173, 1999.
[33] L. Rudolph, M. SlivkinAllalouf, and E. Upfal, “A Simple Load Balancing Scheme for Task Allocation in Parallel Machines,” Proc. Third ACM Symp. Parallel Algorithms and Architectures (SPAA '91), pp. 237245, 1991.
[34] U. Schwiegelshohn, W. Ludwig, J.L. Wolf, J. Turek, and P.S. Yu, “Smart Bounds for Weighted Response Time Scheduling,” SIAM J.Computing, vol. 28, no. 1, pp. 237253, 1998.
[35] S. Sen, “Dynamic Processor Allocation for Adaptively Parallel Jobs,” master's thesis, Massachusetts Inst. Tech nology, 2004.
[36] K.C. Sevcik, “Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems,” Performance Evaluation, vol. 19, no. 2/3, pp. 107140, 1994.
[37] D.B. Shmoys, J. Wein, and D.P. Williamson, “Scheduling Parallel Machines Online,” Proc. 32nd Ann. IEEE Symp. Foundations of Computer Science (FOCS '91), pp. 131140, 1991.
[38] B. Song, “Scheduling Adaptively Parallel Jobs,” master's thesis, Massachusetts Inst. Tech nology, 1998.
[39] M.S. Squillante, “On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems,” Proc. Ninth IEEE Int'l Parallel Processing Symp. (IPPS '95), pp. 219238, 1995.
[40] K. Guha and T.B. Brecht, “Using Parallel Program Characteristics in Dynamic Processor Allocation Policies,” Performance Evaluation, vol. 27/28, pp. 519539, 1996.
[41] A. Tucker and A. Gupta, “Process Control and Scheduling Issues for Multiprogrammed SharedMemory Multiprocessors,” Proc. 12th ACM Symp. Operating Systems Principles (SOSP '89), pp. 159166, 1989.
[42] J. Turek, W. Ludwig, J.L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P.S. Yu, “Scheduling Parallelizable Tasks to Minimize Average Response Time,” Proc. Sixth ACM Symp. Parallel Algorithms and Architectures (SPAA '94), pp. 200209, 1994.
[43] J. Zahorjan and C. McCann, “Processor Scheduling in Shared Memory Multiprocessors,” Proc. ACM SIGMETRICS '90, pp.214225, 1990.
[44] G.K. Zipf, Human Behaviour and the Principle of LeastEffort. AddisonWesley, 1949.