메뉴 건너뛰기




Volumn 13, Issue 1, 2007, Pages 33-45

A simple linear time approximation algorithm for multi-processor job scheduling on four processors

Author keywords

Approximation algorithm; Multi processor job scheduling; NP hard problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SCHEDULING;

EID: 33751077314     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9011-y     Document Type: Article
Times cited : (11)

References (21)
  • 2
    • 33751071390 scopus 로고    scopus 로고
    • Personal communication
    • Arambula I (2005) Personal communication
    • (2005)
    • Arambula, I.1
  • 3
    • 21844518507 scopus 로고
    • Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
    • Bianco L, Blazewicz J, Dell'Olmo P, Drozdowski M (1995) Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Ann Oper Res 58:493-517
    • (1995) Ann Oper Res , vol.58 , pp. 493-517
    • Bianco, L.1    Blazewicz, J.2    Dell'Olmo, P.3    Drozdowski, M.4
  • 5
    • 0027110432 scopus 로고
    • Corrigendum to Scheduling multiprocessor tasks on the three dedicated processors
    • Blazewicz J, Dell'Olmo P, Drozdowski M, Speranza M (1992/1994) Corrigendum to Scheduling multiprocessor tasks on the three dedicated processors. Inf Proc Lett 41:275-280.
    • (1992) Inf Proc Lett , vol.41 , pp. 275-280
    • Blazewicz, J.1    Dell'Olmo, P.2    Drozdowski, M.3    Speranza, M.4
  • 6
    • 33751087060 scopus 로고    scopus 로고
    • Inf Proc Lett 49:269-270
    • Inf Proc Lett , vol.49 , pp. 269-270
  • 7
    • 0022717856 scopus 로고
    • Scheduling multiprocessor tasks to minimize scheduling length
    • Blazewicz J, Drozdowski M, Weglarz J (1986) Scheduling multiprocessor tasks to minimize scheduling length. IEEE Trans Comput 35:389-393
    • (1986) IEEE Trans Comput , vol.35 , pp. 389-393
    • Blazewicz, J.1    Drozdowski, M.2    Weglarz, J.3
  • 9
    • 0033079757 scopus 로고    scopus 로고
    • General multiprocessor tasks scheduling
    • Chen J, Lee C-Y (1999) General multiprocessor tasks scheduling. Naval Res Log 46:59-74
    • (1999) Naval Res Log , vol.46 , pp. 59-74
    • Chen, J.1    Lee, C.-Y.2
  • 10
    • 0036218779 scopus 로고    scopus 로고
    • A polynomial time approximation scheme for general multiprocessor job scheduling
    • Chen J, Miranda A (2001) A polynomial time approximation scheme for general multiprocessor job scheduling. SIAM J Comput 31:1-17
    • (2001) SIAM J Comput , vol.31 , pp. 1-17
    • Chen, J.1    Miranda, A.2
  • 11
    • 0008757653 scopus 로고    scopus 로고
    • Efficiency and effectiveness of normal schedules on three dedicated processors
    • Dell' Olmo P, Speranza MG, Tuza Zs (1997) Efficiency and effectiveness of normal schedules on three dedicated processors. Discrete Math 164:67-79
    • (1997) Discrete Math , vol.164 , pp. 67-79
    • Dell'Olmo, P.1    Speranza, M.G.2    Tuza, Zs.3
  • 12
    • 0024701172 scopus 로고
    • Simultaneous resource scheduling to minimize weighted flow times
    • Dobson G, Karmarkar U (1989) Simultaneous resource scheduling to minimize weighted flow times. Oper Res 37:592-600
    • (1989) Oper Res , vol.37 , pp. 592-600
    • Dobson, G.1    Karmarkar, U.2
  • 14
    • 0003039647 scopus 로고
    • An approximation algorithm for scheduling on three dedicated machines
    • Goemans MX (1995) An approximation algorithm for scheduling on three dedicated machines. Discrete Appl Math 61:49-59
    • (1995) Discrete Appl Math , vol.61 , pp. 49-59
    • Goemans, M.X.1
  • 15
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessing anomalies
    • Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Sys Tech J 45:1563-1581
    • (1966) Bell Sys Tech J , vol.45 , pp. 1563-1581
    • Graham, R.L.1
  • 16
    • 0002552417 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling
    • Hochbaum DS, (ed.). PWS Publishing Company
    • Hall LA (1997) Approximation algorithms for scheduling. In: Hochbaum DS, (ed.) Approximation algorithms for NP-hard problems. PWS Publishing Company, pp 1-45
    • (1997) Approximation Algorithms for NP-hard Problems , pp. 1-45
    • Hall, L.A.1
  • 17
    • 0000071158 scopus 로고
    • Complexity of scheduling multiprocessor tasks with prespecified processor allocations
    • Hoogeveen JA, van de Velde SL, Veltman B (1994) Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl Math 55:259-272
    • (1994) Discrete Appl Math , vol.55 , pp. 259-272
    • Hoogeveen, J.A.1    Van De Velde, S.L.2    Veltman, B.3
  • 18
    • 33745444339 scopus 로고    scopus 로고
    • General multiprocessor task scheduling: Approximate solutions in linear time
    • Jansen K, Porkolab L (2005) General multiprocessor task scheduling: approximate solutions in linear time. SIAM J Comput 35:519-530
    • (2005) SIAM J Comput , vol.35 , pp. 519-530
    • Jansen, K.1    Porkolab, L.2
  • 19
    • 0022121187 scopus 로고
    • An approximation algorithm for diagnostic test scheduling in multicomputer systems
    • Krawczyk H, Kubale M (1985) An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans Comput 34:869-872
    • (1985) IEEE Trans Comput , vol.34 , pp. 869-872
    • Krawczyk, H.1    Kubale, M.2
  • 20
    • 0032672426 scopus 로고    scopus 로고
    • Scheduling one and two-processor tasks on two parallel processors
    • Lee C-Y, Cai X (1999) Scheduling one and two-processor tasks on two parallel processors. IIE Trans 31:445-455
    • (1999) IIE Trans , vol.31 , pp. 445-455
    • Lee, C.-Y.1    Cai, X.2
  • 21
    • 0031492360 scopus 로고    scopus 로고
    • Current trends in deterministic scheduling
    • Lee C-Y, Lei L, Pinedo M (1997) Current trends in deterministic scheduling. Ann Ope Res 70:1-42
    • (1997) Ann Ope Res , vol.70 , pp. 1-42
    • Lee, C.-Y.1    Lei, L.2    Pinedo, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.