메뉴 건너뛰기




Volumn , Issue , 2013, Pages 123-130

Using time discretization to schedule scientific workflows in multiple cloud providers

Author keywords

cloud computing; ILP; scheduling; workflow

Indexed keywords

APPLICATION REQUIREMENTS; COMPUTATIONAL RESOURCES; DEADLINE CONSTRAINT; ILP; SCIENTIFIC WORKFLOWS; TIME-DISCRETIZATION; WORKFLOW; WORKFLOW APPLICATIONS;

EID: 84897704968     PISSN: 21596182     EISSN: 21596190     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2013.141     Document Type: Conference Paper
Times cited : (18)

References (11)
  • 1
    • 25144491255 scopus 로고    scopus 로고
    • Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
    • C. Floudas and X. Lin, "Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications," Annals of Operations Research, vol. 139, pp. 131-162, 2005.
    • (2005) Annals of Operations Research , vol.139 , pp. 131-162
    • Floudas, C.1    Lin, X.2
  • 4
    • 80051785207 scopus 로고    scopus 로고
    • Discrete and continuous time representations and mathematical models for large production scheduling problems: A case study from the pharmaceutical industry
    • 2011
    • H. Stefansson, S. Sigmarsdottir, P. Jensson, and N. Shah, "Discrete and continuous time representations and mathematical models for large production scheduling problems: A case study from the pharmaceutical industry," European Journal of Operational Research, vol. 215, no. 2, pp. 383-392, 2011.
    • European Journal of Operational Research , vol.215 , Issue.2 , pp. 383-392
    • Stefansson, H.1    Sigmarsdottir, S.2    Jensson, P.3    Shah, N.4
  • 8
    • 84861638116 scopus 로고    scopus 로고
    • SLA-based admission control for a software-as-a-service provider in cloud computing environments
    • 2012
    • L. Wu, S. K. Garg, and R. Buyya, "SLA-based admission control for a software-as-a-service provider in cloud computing environments," Journal of Computer and System Sciences, vol. 78, no. 5, pp. 1280-1299, 2012.
    • Journal of Computer and System Sciences , vol.78 , Issue.5 , pp. 1280-1299
    • Wu, L.1    Garg, S.K.2    Buyya, R.3
  • 9
    • 0000965083 scopus 로고    scopus 로고
    • Improving the efficiency of discrete time scheduling formulation
    • K. L. Yee and N. Shah, "Improving the efficiency of discrete time scheduling formulation," Journal of Computers Chemical Engineering, vol. 22, Suupl. 1, pp. S403-S410, 1998.
    • (1998) Journal of Computers Chemical Engineering , vol.22 , Issue.SUPPL. 1
    • Yee, K.L.1    Shah, N.2
  • 10
    • 2442583184 scopus 로고    scopus 로고
    • Continuous-time versus discretetime approaches for scheduling of chemical processes: A review
    • C. A. Floudas and X. Lin, "Continuous-time versus discretetime approaches for scheduling of chemical processes: a review," Computers & Chemical Engineering, vol. 28, no. 11, pp. 2109-2129, 2004.
    • (2004) Computers & Chemical Engineering , vol.28 , Issue.11 , pp. 2109-2129
    • Floudas, C.A.1    Lin, X.2


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