메뉴 건너뛰기




Volumn 71, Issue 6, 2011, Pages 848-862

BTS: Resource capacity estimate for time-targeted science workflows

Author keywords

Cloud computing; Distributed system; Resource allocation; Scientific application; Workflow management

Indexed keywords

CRITICAL CHALLENGES; DISTRIBUTED SYSTEMS; FINISH TIME; LOWER BOUNDS; PARALLEL TASK; RESOURCE CAPACITY; RESOURCE DESCRIPTION LANGUAGES; RESOURCE PROVISIONING; SCIENTIFIC APPLICATIONS; TIME SCHEDULING; WORK-FLOWS; WORKFLOW MANAGEMENT; WORKFLOW TECHNOLOGY;

EID: 79955639124     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2011.01.008     Document Type: Article
Times cited : (65)

References (50)
  • 1
    • 0016313256 scopus 로고
    • A comparison of list schedules for parallel processing systems
    • T.L. Adam, K.M. Chandy, and J.R. Dickson A comparison of list schedules for parallel processing systems Communications of the ACM 17 12 1974 685 690
    • (1974) Communications of the ACM , vol.17 , Issue.12 , pp. 685-690
    • Adam, T.L.1    Chandy, K.M.2    Dickson, J.R.3
  • 5
    • 70349925723 scopus 로고    scopus 로고
    • A case study on the use of workflow technologies for scientific analysis: Gravitational wave data analysis
    • Springer
    • D.A. Brown, P.R. Brady, A. Dietz, J. Cao, B. Johnson, and J. McNabb A case study on the use of workflow technologies for scientific analysis: gravitational wave data analysis Workflows for e-Science 2006 Springer Chapter
    • (2006) Workflows for E-Science
    • Brown, D.A.1    Brady, P.R.2    Dietz, A.3    Cao, J.4    Johnson, B.5    McNabb, J.6
  • 6
    • 16644376501 scopus 로고    scopus 로고
    • Scheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm
    • DOI 10.1002/spe.646
    • R. Buyya, M. Murshed, D. Abramson, and S. Venugopal Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost-time optimization algorithm SoftwarePractice and Experience 35 2005 491 512 (Pubitemid 40479560)
    • (2005) Software - Practice and Experience , vol.35 , Issue.5 , pp. 491-512
    • Buyya, R.1    Murshed, M.2    Abramson, D.3    Venugopal, S.4
  • 7
    • 84948463070 scopus 로고    scopus 로고
    • A resource management architecture for metacomputing systems IPPS/SPDP'98 Workshop on Job Scheduling Strategies for Parallel Processing
    • K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, and S. Tuecke A resource management architecture for metacomputing systems IPPS/SPDP'98 Workshop on Job Scheduling Strategies for Parallel Processing Lecture Notes in Computer Science vol. 1459 1998 62 820
    • (1998) Lecture Notes in Computer Science , vol.1459 , pp. 62-82
    • Czajkowski, K.1    Foster, I.2    Karonis, N.3    Kesselman, C.4    Martin, S.5    Smith, W.6    Tuecke, S.7
  • 13
    • 79955625926 scopus 로고    scopus 로고
    • Usc epigenomic center
    • Usc epigenomic center. http://epigenome.usc.edu.
  • 14
    • 44049113422 scopus 로고
    • A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
    • A. Geras A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors Journal of Parallel and Distributed Computing 16 4 1992 276 291
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , Issue.4 , pp. 276-291
    • Geras, A.1
  • 23
    • 33749000266 scopus 로고    scopus 로고
    • An approximation algorithm for scheduling malleable tasks under general precedence constraints
    • J. Klaus, and Z. Hu An approximation algorithm for scheduling malleable tasks under general precedence constraints ACM Transactions on Algorithms 2 3 2006 416 434
    • (2006) ACM Transactions on Algorithms , vol.2 , Issue.3 , pp. 416-434
    • Klaus, J.1    Hu, Z.2
  • 24
    • 0001514167 scopus 로고    scopus 로고
    • Benchmarking and Comparison of the Task Graph Scheduling Algorithms
    • DOI 10.1006/jpdc.1999.1578, PII S0743731599915782
    • Y.K. Kwok, and I. Ahmad Benchmarking and comparison of the task graph scheduling algorithms Journal of Parallel and Distributed Computing 59 3 1999 381 422 (Pubitemid 129592990)
    • (1999) Journal of Parallel and Distributed Computing , vol.59 , Issue.3 , pp. 381-422
    • Kwok, Y.-K.1    Ahmad, I.2
  • 26
    • 52449093583 scopus 로고    scopus 로고
    • High-throughput, kingdom-wide prediction and annotation of bacterial non-coding RNAs
    • J. Livny, H. Teonadi, M. Livny, and M.K. Waldor High-throughput, kingdom-wide prediction and annotation of bacterial non-coding RNAs PLoS One 3 9 2008
    • (2008) PLoS One , vol.3 , Issue.9
    • Livny, J.1    Teonadi, H.2    Livny, M.3    Waldor, M.K.4
  • 27
    • 0033377664 scopus 로고    scopus 로고
    • EMAN: Semiautomated software for high-resolution single-particle reconstructions
    • DOI 10.1006/jsbi.1999.4174
    • S.J. Ludtke, P.R. Baldwin, and W. Chiu EMAN: semiautomated software for high-resolution single-particle reconstructions Journal of Structural Biology 128 1999 82 97 (Pubitemid 30013436)
    • (1999) Journal of Structural Biology , vol.128 , Issue.1 , pp. 82-97
    • Ludtke, S.J.1    Baldwin, P.R.2    Chiu, W.3
  • 33
    • 33947375217 scopus 로고    scopus 로고
    • CASA and LEAD: Adaptive cyberinfrastructure for real-time multiscale weather forecasting
    • B. Plale CASA and LEAD: adaptive cyberinfrastructure for real-time multiscale weather forecasting IEEE Computer 39 2006 56 64
    • (2006) IEEE Computer , vol.39 , pp. 56-64
    • Plale, B.1
  • 37
    • 0031271853 scopus 로고    scopus 로고
    • A framework for exploiting task and data parallelism on distributed memory multicomputers
    • S. Ramaswamy, S. Sapatnekar, and P. Banerjee A framework for exploiting task and data parallelism on distributed memory multicomputers IEEE Transactions on Parallel and Distributed Systems 8 11 1997 1098 1116 (Pubitemid 127763322)
    • (1997) IEEE Transactions on Parallel and Distributed Systems , vol.8 , Issue.11 , pp. 1098-1116
    • Ramaswamy, S.1    Sapatnekar, S.2    Banerjee, P.3
  • 41
    • 0027542932 scopus 로고
    • A compile-tim scheduling heuristics for interconnection-constrained heterogeneous processor architecture
    • G.C. Shih, and E.A. Lee A compile-tim scheduling heuristics for interconnection-constrained heterogeneous processor architecture IEEE Transactions on Parallel and Distributed Systems 4 2 1993 75 87
    • (1993) IEEE Transactions on Parallel and Distributed Systems , vol.4 , Issue.2 , pp. 75-87
    • Shih, G.C.1    Lee, E.A.2
  • 45
    • 0036504666 scopus 로고    scopus 로고
    • Performance-effective and low-complexity task scheduling for heterogeneous computing
    • DOI 10.1109/71.993206
    • H. Topcuoglu, S. Hariri, and M. Wu Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Transactions on Parallel and Distributed Systems 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
  • 48
    • 33947504537 scopus 로고    scopus 로고
    • Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms
    • Scientific Workflow
    • J. Yu, and R. Buyya Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms Scientific Programming Journal 14 34 2006 217 230 (Pubitemid 46474559)
    • (2006) Scientific Programming , vol.14 , Issue.3-4 , pp. 217-230
    • Yu, J.1    Buyya, R.2


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