메뉴 건너뛰기




Volumn , Issue , 2004, Pages 666-673

A new task scheduling method for distributed programs which require memory management in grids

Author keywords

CP MM; Critical path scheduling; Garbage collection; Java RMI; Memory management; Task scheduling

Indexed keywords

COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; DATA PROCESSING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; PERSONAL COMPUTERS; SCHEDULING; XML;

EID: 2642545946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/saintw.2004.1268708     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 1
    • 0016313256 scopus 로고
    • A comparison of list scheduling for parallel processing systems
    • T. Adam, L. Chandy, and J. Dickson. A comparison of list scheduling for parallel processing systems. Communication of ACM, 17(12):685-690, 1974.
    • (1974) Communication of ACM , vol.17 , Issue.12 , pp. 685-690
    • Adam, T.1    Chandy, L.2    Dickson, J.3
  • 2
    • 2642548693 scopus 로고    scopus 로고
    • A proposal for parallel combinatorial optimization system for the grid
    • 2002-HPC-91. in Japanese
    • T. Akiyama, H. Nakada, S. Matsuoka, and S. Sekiguchi. A proposal for parallel combinatorial optimization system for the grid. The Special Interest Group Notes of IPSJ, 2002(80, 2002-HPC-91): 143-148, 2002. (in Japanese).
    • (2002) The Special Interest Group Notes of IPSJ , vol.2002 , Issue.80 , pp. 143-148
    • Akiyama, T.1    Nakada, H.2    Matsuoka, S.3    Sekiguchi, S.4
  • 4
    • 2642513690 scopus 로고    scopus 로고
    • A selection scheme of the node to consider a load factor for campus grid
    • 2002-HPC-91. in Japanese
    • H. Arikawa and H. Sunahara. A selection scheme of the node to consider a load factor for campus grid. The Special Interest Group Notes of IPSJ, 2002(80,2002-HPC-91):167-172, 2002. (in Japanese).
    • (2002) The Special Interest Group Notes of IPSJ , vol.2002 , Issue.80 , pp. 167-172
    • Arikawa, H.1    Sunahara, H.2
  • 6
    • 2642552025 scopus 로고    scopus 로고
    • dRuby
    • dRuby. http://www2a.biglobe.ne.jp/%7Eseki/ruby/druby.html.
  • 9
    • 0347387839 scopus 로고
    • Coarse grain parallelism detection scheme of a fortran program
    • H. Honda, M. Iwata, and H. Kasahara. Coarse grain parallelism detection scheme of a fortran program. Transaction of IEICE, J73-D-1(12):951-960, 1990.
    • (1990) Transaction of IEICE , vol.J73-D-1 , Issue.12 , pp. 951-960
    • Honda, H.1    Iwata, M.2    Kasahara, H.3
  • 11
    • 0021529549 scopus 로고
    • Practical multiprocessor scheduling algorithms for efficient parallel processing
    • H. Kasahara and S. Narita. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers, C-33(11), 1984.
    • (1984) IEEE Transactions on Computers , vol.C-33 , Issue.11
    • Kasahara, H.1    Narita, S.2
  • 13
    • 48049116443 scopus 로고    scopus 로고
    • Kasahara Laboratory, Waseda University. Standard Task Graph Set. http://www.kasahara.elec.waseda.ac.jp/schedule.
    • Standard Task Graph Set
  • 15
    • 2642512847 scopus 로고    scopus 로고
    • Meta-scheduling - Trial of automatic distributed computing
    • in Japansese
    • H. Koide and H. Kasahara. Meta-scheduling - trial of automatic distributed computing -. bit, 33(4):36-41, 2001. (in Japansese).
    • (2001) Bit , vol.33 , Issue.4 , pp. 36-41
    • Koide, H.1    Kasahara, H.2
  • 16
    • 2642581368 scopus 로고    scopus 로고
    • Evaluation of the resource information prediction in the resource information server
    • SIG3(PRO10). in Japanese
    • H. Koide, N. Yamagishi, H. Takemiya, and H. Kasahara. Evaluation of the resource information prediction in the resource information server. IPSJ Transaction on Programming, 42(SIG3(PRO10)):65-73, 2001. (in Japanese).
    • (2001) IPSJ Transaction on Programming , vol.42 , pp. 65-73
    • Koide, H.1    Yamagishi, N.2    Takemiya, H.3    Kasahara, H.4
  • 17
    • 0030142084 scopus 로고    scopus 로고
    • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    • Y. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5), 1996.
    • (1996) IEEE Transactions on Parallel and Distributed Systems , vol.7 , Issue.5
    • Kwok, Y.1    Ahmad, I.2
  • 18
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Y. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406-471, 1999.
    • (1999) ACM Computing Surveys , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.1    Ahmad, I.2
  • 21
    • 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. Journal of Future Generation Computing Systems, 15(5-6):757-768, 1999.
    • (1999) Journal of Future Generation Computing Systems , vol.15 , Issue.5-6 , pp. 757-768
    • Wolski, R.1    Spring, N.2    Hayes, J.3


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