메뉴 건너뛰기




Volumn 27, Issue 8, 2011, Pages 1083-1091

A stochastic scheduling algorithm for precedence constrained tasks on Grid

Author keywords

Grid; Makespan; Precedence constrained tasks; Stochastic scheduling

Indexed keywords

COMMUNICATION TIME; CONSTRAINED TASKS; EXPECTED VALUES; FINISH TIME; GRID; GRID COMPUTING SYSTEMS; GRID SYSTEMS; MAKESPAN; PARALLEL APPLICATION; PERFORMANCE EVALUATION; PROCESSING TIME; STANDARD DEVIATION; STOCHASTIC ENVIRONMENT; STOCHASTIC PROCESSING TIME; STOCHASTIC SCHEDULING;

EID: 79960451210     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2011.04.007     Document Type: Article
Times cited : (71)

References (30)
  • 1
    • 55949098372 scopus 로고    scopus 로고
    • Towards a general model of the multi-criteria workflow scheduling on the grid
    • M. Wieczoreka, A. Hoheiselb, and R. Prodana Towards a general model of the multi-criteria workflow scheduling on the grid Future Gener. Comput. Syst. 25 3 2009 237 256
    • (2009) Future Gener. Comput. Syst. , vol.25 , Issue.3 , pp. 237-256
    • Wieczoreka, M.1    Hoheiselb, A.2    Prodana, R.3
  • 3
    • 67349258492 scopus 로고    scopus 로고
    • A comparison of centralized and distributed meta-scheduling architectures for computation and communication tasks in grid networks
    • K. Christodoulopoulos, V. Sourlas, I. Mpakolas, and E. Varvarigos A comparison of centralized and distributed meta-scheduling architectures for computation and communication tasks in grid networks Comput. Commun. 32 8 2009 1172 1184
    • (2009) Comput. Commun. , vol.32 , Issue.8 , pp. 1172-1184
    • Christodoulopoulos, K.1    Sourlas, V.2    Mpakolas, I.3    Varvarigos, E.4
  • 5
    • 0025440941 scopus 로고
    • Scheduling parallel program tasks onto arbitrary target machines
    • DOI 10.1016/0743-7315(90)90042-N
    • H. El-Rewini, and T.G. Lewis Scheduling parallel program tasks onto arbitrary target machines J. Parallel Distrib. Comput. 9 2 1990 138 153 (Pubitemid 20729738)
    • (1990) Journal of Parallel and Distributed Computing , vol.9 , Issue.2 , pp. 138-153
    • El-Rewini Hesham1    Lewis, T.G.2
  • 6
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    • Y.-K. Kwok, and I. Ahmad Dynamic critical-path scheduling: an effective technique for allocating task graphs onto multiprocessors IEEE Trans. Parallel Distrib. Syst. 7 5 1996 506 521 (Pubitemid 126782383)
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.5 , pp. 506-521
    • Kwok, Y.-K.1    Ahmad, I.2
  • 8
    • 0027542932 scopus 로고
    • A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures
    • G.C. Sih, and E.A. Lee A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures IEEE Trans. Parallel Distrib. Syst. 4 2 1993 175 187
    • (1993) IEEE Trans. Parallel Distrib. Syst. , vol.4 , Issue.2 , pp. 175-187
    • Sih, G.C.1    Lee, E.A.2
  • 9
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • DOI 10.1109/71.993206
    • H. Topcuoglu, S. Hariri, and M.-Y. Wu Performance-effective and low complexity task scheduling for heterogeneous computing IEEE Trans. Parallel Distrib. Syst. 13 3 2002 260 274 (Pubitemid 34448780)
    • (2002) IEEE Transactions on Parallel and Distributed Systems , vol.13 , Issue.3 , pp. 260-274
    • Topcuoglu, H.1    Hariri, S.2    Wu, M.-Y.3
  • 10
    • 58149510939 scopus 로고    scopus 로고
    • Communication contention in APN list scheduling algorithm
    • X. Tang, K. Li, and D. Padua Communication contention in APN list scheduling algorithm Sci. China Ser. F 52 1 2009 59 69
    • (2009) Sci. China Ser. F , vol.52 , Issue.1 , pp. 59-69
    • Tang, X.1    Li, K.2    Padua, D.3
  • 11
    • 76849102536 scopus 로고    scopus 로고
    • List scheduling with duplication for heterogeneous computing systems
    • X. Tang, K. Li, G. Liao, and R. Li List scheduling with duplication for heterogeneous computing systems J. Parallel Distrib. Comput. 70 4 2010 323 329
    • (2010) J. Parallel Distrib. Comput. , vol.70 , Issue.4 , pp. 323-329
    • Tang, X.1    Li, K.2    Liao, G.3    Li, R.4
  • 12
    • 77955509553 scopus 로고    scopus 로고
    • Reliability-aware scheduling strategy for heterogeneous distributed computing systems
    • X. Tang, K. Li, R. Li, and B. Veeravalli Reliability-aware scheduling strategy for heterogeneous distributed computing systems J. Parallel Distrib. Comput. 70 9 2010 941 952
    • (2010) J. Parallel Distrib. Comput. , vol.70 , Issue.9 , pp. 941-952
    • Tang, X.1    Li, K.2    Li, R.3    Veeravalli, B.4
  • 13
    • 0001175654 scopus 로고    scopus 로고
    • Approximation in stochastic scheduling: The power of LP-based priority policies
    • R.H. Möring, A.S. Schulz, and M. Uetz Approximation in stochastic scheduling: the power of LP-based priority policies J. ACM 46 6 1999 924 942
    • (1999) J. ACM , vol.46 , Issue.6 , pp. 924-942
    • Möring, R.H.1    Schulz, A.S.2    Uetz, M.3
  • 14
    • 33745218250 scopus 로고    scopus 로고
    • A new average case analysis for completion time scheduling
    • Mark Scharbrodt, Thomas Schickingera, and Angelika Steger A new average case analysis for completion time scheduling J. ACM 53 1 2006 121 146
    • (2006) J. ACM , vol.53 , Issue.1 , pp. 121-146
    • Scharbrodt, M.1    Schickingera, T.2    Steger, A.3
  • 16
    • 65849231067 scopus 로고    scopus 로고
    • Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems
    • M. Qiu, and E.H.-M. Sha Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems ACM Trans. Des. Autom. Electron. Syst. 14 2 2009 1 30
    • (2009) ACM Trans. Des. Autom. Electron. Syst. , vol.14 , Issue.2 , pp. 1-30
    • Qiu, M.1    Sha, E.H.-M.2
  • 17
    • 0005372684 scopus 로고
    • Scheduling with random service times
    • M.H. Rothkopf Scheduling with random service times Manage. Sci. 12 9 1966 703 713
    • (1966) Manage. Sci. , vol.12 , Issue.9 , pp. 703-713
    • Rothkopf, M.H.1
  • 18
    • 0002342497 scopus 로고
    • Approximation results in parallel machines stochastic scheduling
    • G. Weiss Approximation results in parallel machines stochastic scheduling Ann. Oper. Res. 26 1 1990 195 242
    • (1990) Ann. Oper. Res. , vol.26 , Issue.1 , pp. 195-242
    • Weiss, G.1
  • 19
    • 0000159196 scopus 로고
    • Turnpike optimality of Smiths rule in parallel machines stochastic scheduling
    • G. Weiss Turnpike optimality of Smiths rule in parallel machines stochastic scheduling Math. Oper. Res. 17 2 1992 255 270
    • (1992) Math. Oper. Res. , vol.17 , Issue.2 , pp. 255-270
    • Weiss, G.1
  • 20
    • 33748418908 scopus 로고    scopus 로고
    • Models and algorithms for stochastic online scheduling
    • DOI 10.1287/moor.1060.0201
    • N. Megow, M. Uetz, and T. Vredeveld Models and algorithms for stochastic online scheduling Math. Oper. Res. 31 3 2006 513 525 (Pubitemid 44343606)
    • (2006) Mathematics of Operations Research , vol.31 , Issue.3 , pp. 513-525
    • Megow, N.1    Uetz, M.2    Vredeveld, T.3
  • 21
    • 24344463067 scopus 로고    scopus 로고
    • Stochastic machine scheduling with precedence constraints
    • DOI 10.1137/S0097539702415007
    • Martin Skutella, and Marc Uetz Stochastic machine scheduling with precedence constraints SIAM J. Comput. 34 4 2005 788 802 (Pubitemid 41246993)
    • (2005) SIAM Journal on Computing , vol.34 , Issue.4 , pp. 788-802
    • Skutella, M.1    Uetz, M.2
  • 22
    • 85016745898 scopus 로고
    • Scheduling partially ordered tasks with probabilistic execution times
    • K.M. Chandy, and P.F. Reynolds Scheduling partially ordered tasks with probabilistic execution times Oper. Syst. Rev. 9 1975 169 177
    • (1975) Oper. Syst. Rev. , vol.9 , pp. 169-177
    • Chandy, K.M.1    Reynolds, P.F.2
  • 23
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Ann. Discrete Math. 5 1979 287 326
    • (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
    • Graham, R.L.1    Lawler, E.L.2    Lenstra, J.K.3    Rinnooy Kan, A.H.G.4
  • 24
    • 0033114757 scopus 로고    scopus 로고
    • A review of scheduling research involving setup considerations
    • A. Allahverdi, J.N.D. Gupta, and T. Aldowaisan A review of scheduling research involving setup considerations Manage. Sci. 27 1999 219 239
    • (1999) Manage. Sci. , vol.27 , pp. 219-239
    • Allahverdi, A.1    Gupta, J.N.D.2    Aldowaisan, T.3
  • 25
    • 0022075297 scopus 로고
    • On scheduling tasks with exponential service times and in-tree precedence constraints
    • J. Bruno On scheduling tasks with exponential service times and in-tree precedence constraints Acta Inform. 22 1985 139 148 (Pubitemid 15528278)
    • (1985) Acta Informatica , vol.22 , Issue.2 , pp. 139-148
    • Bruno John1
  • 26
    • 0022147672 scopus 로고
    • Scheduling jobs with exponentially distributed processing times and in tree precedence constraints on two parallel machines
    • M. Pinedo, and G. Weiss Scheduling jobs with exponentially distributed processing times and in tree precedence constraints on two parallel machines Oper. Res. 33 1985 1381 1388 (Pubitemid 16457311)
    • (1985) Operations Research , vol.33 , Issue.6 , pp. 1381-1388
    • Pinedo Michael1    Weiss Gideon2
  • 27
    • 0023289282 scopus 로고
    • On stochastic scheduling with in-tree precedence constraints
    • C.H. Papadimitriou, and J.N. Tsitsiklis On stochastic scheduling with in-tree precedence constraints SIAM J. Comput. 16 1987 1 6
    • (1987) SIAM J. Comput. , vol.16 , pp. 1-6
    • Papadimitriou, C.H.1    Tsitsiklis, J.N.2
  • 28
    • 0346234052 scopus 로고
    • On the optimal stochastic scheduling of out-forests
    • E.G. Coffman, and Z. Liu On the optimal stochastic scheduling of out-forests Oper. Res. 40 1992 867 875
    • (1992) Oper. Res. , vol.40 , pp. 867-875
    • Coffman, E.G.1    Liu, Z.2
  • 30
    • 67349129734 scopus 로고    scopus 로고
    • A parallel solution for scheduling of real time applications on grid environments
    • M. Kalantari, and M. Akbaria A parallel solution for scheduling of real time applications on grid environments Future Gener. Comput. Syst. 25 7 2009 704 716
    • (2009) Future Gener. Comput. Syst. , vol.25 , Issue.7 , pp. 704-716
    • Kalantari, M.1    Akbaria, M.2


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