
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Satoshi Fujita, "A BranchandBound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques," IEEE Transactions on Computers, vol. 60, no. 7, pp. 10061016, July, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.120, author = {Satoshi Fujita}, title = {A BranchandBound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {7}, issn = {00189340}, year = {2011}, pages = {10061016}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.120}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A BranchandBound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques IS  7 SN  00189340 SP1006 EP1016 EPD  10061016 A1  Satoshi Fujita, PY  2011 KW  Branchandbound algorithm KW  multiprocessor scheduling problem KW  lower bound on the execution time. VL  60 JA  IEEE Transactions on Computers ER   
[1] T.L. Adam, K.M. Chandy, and J.R. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, vol. 17, no. 12, pp. 685690, 1974.
[2] M.A. AlMouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs," IEEE Trans. Software Eng., vol. 16, no. 12, pp. 13901401, Dec. 1990.
[3] M.A. Mouhamed and A.A. Maasarani, "Performance Evaluation of Scheduling PrecedenceConstrained Computations on MessagePassing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 13171321, Dec. 1994.
[4] P. Brucker, Scheduling Algorithms, third ed. Springer, 1997.
[5] Y.E. Chen and D.L. Epley, "Bounds on Memory Requirements on Multiprocessor Systems," Proc. Sixth Ann. Allerton Conf. Circuit and System Theory, pp. 523531, 1968.
[6] Scheduling Theory and Its Applications, P. Chretienne et al., eds. John Wiley & Sons, 1997.
[7] E. Coffman,Jr., and R. Graham, "Optimal Scheduling for Two Processor Systems," Acta Informatica, vol. 1, no. 3, pp. 200213, 1972.
[8] H. ElRewini and T.G. Lewis, "Scheduling Parallel Program Tasks onto Arbitrary Target Machines," J. Parallel and Distributed Computing, vol. 9, no. 2, pp. 138153, 1990.
[9] E.B. Fernández and B. Bussell, "Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules," IEEE Trans. Computers, vol. 22, no. 8, pp. 745751, Aug. 1973.
[10] S. Fujita and T. Nakagawa, "Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay," Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '99), pp. 212220, 1999.
[11] S. Fujita and M. Yamashita, "Approximation Algorithms for Multiprocessor Scheduling Problem," IEICE Trans. Information and Systems, vol. E83D, no. 3, pp. 503509, 2000.
[12] T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, vol. 9, no. 6, pp. 841848, 1961.
[13] J.J. Hwang, Y.C. Chow, F.D. Anger, and C.Y. Lee, "Scheduling Precedence Graphs in Systems with Interprocessor Communication Times," SIAM J. Computing, vol. 18, no. 2, pp. 244257, 1989.
[14] K.K. Jain and V. Rajaraman, "Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 879886, Aug. 1994.
[15] H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, no. 11, pp. 10231029, Nov. 1985.
[16] Y.K. Kwok, I. Ahmad, and J. Gu, "FAST: A LowComplexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors," Proc. Int'l Conf. Parallel Processing (ICPP '96), vol. 2, pp. 150157, 1996.
[17] Y.K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406471, 1999.
[18] V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, 1989.
[19] G.C. Sih and E.A. Lee, "A CompileTime Scheduling Heuristic for InterconnectionConstrained Heterogeneous Processor Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175187, Feb. 1993.
[20] C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez,Jr., "Optimal Scheduling Strategies in a Multiprocessor System," IEEE Trans. Computers, vol. 21, no. 2, pp. 137146, Feb. 1972.
[21] http://www.kasahara.elec.waseda.ac.jp/schedule index.html., 2010.
[22] J.D. Ullman, "NPComplete Scheduling Problems," J. Computer and System Sciences, vol. 10, no. 3, pp. 384393, 1975.
[23] M.Y. Wu and D.D. Gajski, "Hypertool: A Programming Aid for MessagePassing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3, pp. 330343, July 1990.
[24] T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 951967, Sept. 1994.