메뉴 건너뛰기




Volumn 3719 LNCS, Issue , 2005, Pages 204-213

Execution environmente and benchmarks for the study of applications' scheduling on clusters

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER AIDED SOFTWARE ENGINEERING; MIDDLEWARE; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

EID: 33646386146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564621_23     Document Type: Conference Paper
Times cited : (4)

References (24)
  • 7
    • 33645381730 scopus 로고    scopus 로고
    • June
    • BYTE's UnixBench. The BYTE's Unix Benchmark Suite. URL: http:// www.tux.org/pub/tux/niemi/unixbench, June 2004.
    • (2004) The BYTE's Unix Benchmark Suite
  • 8
    • 0026852322 scopus 로고
    • A fast recognition-complete processor allocation strategy for hypercube computers
    • P.J. Chuang and N.F. Tzeng. A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers. IEEE Transactions on Computers, 41(4):467-479, 1992.
    • (1992) IEEE Transactions on Computers , vol.41 , Issue.4 , pp. 467-479
    • Chuang, P.J.1    Tzeng, N.F.2
  • 13
    • 19644364226 scopus 로고    scopus 로고
    • lasted access: June 2004
    • The LAM/MPI Homepage. URL: http://www.lam-mpi.org, lasted access: June 2004.
    • The LAM/MPI Homepage
  • 14
    • 0021446570 scopus 로고
    • Anomalies in parallel branch-and-bound algorithms
    • Jane
    • T.H. Lai and S. Sahni. Anomalies in Parallel Branch-and-Bound Algorithms. Communications of the ACM, 27(6):594-602, Jane 1984.
    • (1984) Communications of the ACM , vol.27 , Issue.6 , pp. 594-602
    • Lai, T.H.1    Sahni, S.2
  • 15
    • 10844285258 scopus 로고    scopus 로고
    • Nov.
    • NAS Parallel Benchmarks. URL: http://www.nas.nasa.gov/Software/NPB/, Nov. 2004.
    • (2004) NAS Parallel Benchmarks
  • 16
    • 33645379929 scopus 로고    scopus 로고
    • June
    • The openMosix Homepage. URL: http://openmosix.sourceforge.net, June 2004.
    • (2004) The OpenMosix Homepage
  • 17
    • 19944382369 scopus 로고    scopus 로고
    • Local scheduling out-performs gang scheduling on a beowulf cluster
    • ANU, Canberra
    • P. Strazdins and J. Uhlmann. Local Scheduling out-performs Gang Scheduling on a Beowulf Cluster. Technical Report TR-CS-04-01, ANU, Canberra, 2004.
    • (2004) Technical Report , vol.TR-CS-04-01
    • Strazdins, P.1    Uhlmann, J.2
  • 23
    • 38249008248 scopus 로고
    • Efficient processor allocation strategies for mesh-connected parallel computers
    • Y. Zhu. Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers. Journal of Parallel and Distributed Computing, 16(4):328-337, 1992.
    • (1992) Journal of Parallel and Distributed Computing , vol.16 , Issue.4 , pp. 328-337
    • Zhu, Y.1


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