메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages

Practical divisible load scheduling on grid platforms with APST-DV

Author keywords

[No Author keywords available]

Indexed keywords

APST-DV; CLUSTER PLATFORM; GRID APPLICATION; MASTER-WORKER EXECUTION;

EID: 33746322159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.351     Document Type: Conference Paper
Times cited : (27)

References (39)
  • 1
    • 33746306748 scopus 로고    scopus 로고
    • Special issue on divisible load scheduling
    • Special issue on divisible load scheduling. Cluster Computing, 6, 1, 2003.
    • (2003) Cluster Computing , vol.6 , pp. 1
  • 4
    • 84858928295 scopus 로고    scopus 로고
    • The APST Project. http://grail.sdsc.edu/projects/apst.
  • 6
    • 33644671168 scopus 로고    scopus 로고
    • Scheduling divisible loads on star and tree net works: Results and open problems
    • LIP, École Normale Supérieure de Lyon, September
    • O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang. Scheduling divisible loads on star and tree net works: results and open problems. Technical Report RR-2003-41, LIP, École Normale Supérieure de Lyon, September 2003.
    • (2003) Technical Report , vol.RR-2003-41
    • Beaumont, O.1    Casanova, H.2    Legrand, A.3    Robert, Y.4    Yang, Y.5
  • 9
    • 0242537062 scopus 로고    scopus 로고
    • A new paradigm for load scheduling in distributed systems
    • [9] V. Bharadwaj, D. Ghose, and T. Robertazzi. A new paradigm for load scheduling in distributed systems. Cluster Computing, 6(1):7-18, 2003.
    • (2003) Cluster Computing , vol.6 , Issue.1 , pp. 7-18
    • Bharadwaj, V.1    Ghose, D.2    Robertazzi, T.3
  • 11
  • 14
    • 0033334662 scopus 로고    scopus 로고
    • Strategies for parallel data mining
    • David Skillicorn. Strategies for Parallel Data Mining. IEEE Concurrency, 7(4):26-35, 1999.
    • (1999) IEEE Concurrency , vol.7 , Issue.4 , pp. 26-35
    • Skillicorn, D.1
  • 15
    • 84858914879 scopus 로고    scopus 로고
    • The Ganglia Project, http://ganglia.sourceforge.net.
  • 17
    • 33746278215 scopus 로고    scopus 로고
    • Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources
    • Department of Control and Instrumentation Engineering, Kangwon National University, Korea
    • D. Ghose, H. J. Kim, and T. H. Kim. Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources. Technical Report KNU/CI/MSL/001/2003, Department of Control and Instrumentation Engineering, Kangwon National University, Korea.
    • Technical Report , vol.KNU-CI-MSL-001-2003
    • Ghose, D.1    Kim, H.J.2    Kim, T.H.3
  • 18
    • 84858919808 scopus 로고    scopus 로고
    • The Globus Project, http://www.globus.org.
  • 20
    • 0031574535 scopus 로고    scopus 로고
    • Allocating independent tasks to parallel processors: An experimental study
    • T. Hagerup. Allocating Independent Tasks to Parallel Processors: An Experimental Study. Journal of Parallel and Distributed Computing, 47:185-197, 1997.
    • (1997) Journal of Parallel and Distributed Computing , vol.47 , pp. 185-197
    • Hagerup, T.1
  • 21
    • 84858915633 scopus 로고    scopus 로고
    • HMMER Webpage. http://hmmer.wustl.edu/hmmer-html/.
    • HMMER Webpage
  • 22
    • 3543135594 scopus 로고
    • Factoring: A method for scheduling parallel loops
    • August
    • S. Hummel. Factoring: a Method for Scheduling Parallel Loops. Communications of the ACM, 35(8):90-101, August 1992.
    • (1992) Communications of the ACM , vol.35 , Issue.8 , pp. 90-101
    • Hummel, S.1
  • 28
    • 0038399884 scopus 로고    scopus 로고
    • Ten reasons to use divisible load theory
    • T. Robertazzi. Ten reasons to use divisible load theory. IEEE Computer, 36(5):63-68, 2003.
    • (2003) IEEE Computer , vol.36 , Issue.5 , pp. 63-68
    • Robertazzi, T.1
  • 30
    • 84900311491 scopus 로고    scopus 로고
    • Parallel database processing on a 100 Node PC cluster: Cases for decision support query processing and data mining
    • November
    • T. Tamura, M. Oguchi, and M. Kitsuregawa. Parallel database processing on a 100 Node PC cluster: cases for decision support query processing and data mining. In Proceedings of the 1997 ACM/IEEE conference on Supercomputing, pages 1-16, November 1997.
    • (1997) Proceedings of the 1997 ACM/IEEE Conference on Supercomputing , pp. 1-16
    • Tamura, T.1    Oguchi, M.2    Kitsuregawa, M.3
  • 31
    • 84858919804 scopus 로고    scopus 로고
    • The transcode project. http://www.theorie.physik.uni-goettingen.de/~ostreich/transcode.
  • 33
    • 84858914878 scopus 로고    scopus 로고
    • Visible human project, http://www.nlm.nih.gov/research/visible/visible_human.html.
  • 34
    • 84858928294 scopus 로고    scopus 로고
    • The Scalable Vizualiation Toolkit VizPortal project. https://gpadev.sdsc.edu/dev/swhitmor/visPortal/.
  • 36
    • 0032592464 scopus 로고    scopus 로고
    • The network weather service: A distributed resource performance forecasting service for metacomputing
    • R. Wolski, N. Spring, and J. Hayes. The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Future Generation Computer Systems, 15(5-6):757-768, 1999.
    • (1999) Future Generation Computer Systems , vol.15 , Issue.5-6 , pp. 757-768
    • Wolski, R.1    Spring, N.2    Hayes, J.3
  • 37
    • 12444289509 scopus 로고    scopus 로고
    • Extensions to the multi-installment algorithm: Affine costs and output data transfers
    • Dept. of Computer Science and Engineering, University of California, San Diego, July
    • Y. Yang and H. Casanova. Extensions to The Multi-Installment Algorithm: Affine Costs and Output Data Transfers. Technical Report CS2003-0754, Dept. of Computer Science and Engineering, University of California, San Diego, July 2003.
    • (2003) Technical Report , vol.CS2003-0754
    • Yang, Y.1    Casanova, H.2


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