메뉴 건너뛰기




Volumn , Issue , 2008, Pages 639-644

LGR: The new genetic based scheduler for grid computing systems

Author keywords

Genetic algorithm; Grid computing systems; Lgr; Scheduler

Indexed keywords

BEST CHOICE; CLASSICAL ALGORITHMS; CLASSICAL METHODS; COMMUNICATION COST; COMPUTATIONAL GRIDS; EFFICIENT SCHEDULING; EXECUTION TIME; GRID COMPUTING SYSTEMS; HARD PROBLEMS; HIGH-PERFORMANCE COMPUTING APPLICATIONS; LGR; OPTIMUM SOLUTION; SCHEDULER;

EID: 70449578321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIMCA.2008.30     Document Type: Conference Paper
Times cited : (11)

References (21)
  • 1
    • 62949178579 scopus 로고    scopus 로고
    • Scheduling algorithms for grid computing
    • School of Computing, Queen's University Kingston, Ontario January
    • Fangpeng Dong and Selim G. Akl, "Scheduling Algorithms for Grid Computing": State of the Art and Open Problems, School of Computing, Queen's University Kingston, Ontario January 2006.
    • (2006) State of the Art and Open Problems
    • Dong, F.1    Akl, S.G.2
  • 2
    • 0036871453 scopus 로고    scopus 로고
    • Economic models for resource management and scheduling in grid computing
    • Wiley Press, December
    • R. Buyya and D. Abramson and J. Giddy and H. Stockinger, "Economic Models for Resource Management and Scheduling in Grid Computing", in J. of Concurrency and Computation: Practice and Experience, Volume 14, Issue.13-15, pp. 1507-1542, Wiley Press, December 2002.
    • (2002) J. of Concurrency and Computation: Practice and Experience , vol.14 , Issue.13-15 , pp. 1507-1542
    • Buyya, R.1    Abramson, D.2    Giddy, J.3    Stockinger, H.4
  • 3
    • 70449573149 scopus 로고    scopus 로고
    • The grid: Blueprint for a future computing infrastructure
    • chapter in, edited by I. Foster and C. Kesselman, Morgan Kaufmann Publishers
    • F. Berman, High-Performance Schedulers, chapter in The Grid: Blueprint for a Future Computing Infrastructure, edited by I. Foster and C. Kesselman, Morgan Kaufmann Publishers, 1998.
    • (1998) High-Performance Schedulers
    • Berman, F.1
  • 5
    • 33747770997 scopus 로고    scopus 로고
    • A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
    • Journal of the Franklin Institute 343 (2006)
    • Mohammad Hassan Shenassa, Mahdi Mahmoodi, "A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm", Science Direct, Journal of the Franklin Institute 343 (2006) 361-371, 2006.
    • (2006) Science Direct , pp. 361-371
    • Shenassa, M.H.1    Mahmoodi, M.2
  • 7
    • 0029479819 scopus 로고
    • Process scheduling using genetic algorithms
    • Pai-Chou Wang, Willard Korfhage, "Process Scheduling Using Genetic Algorithms", IEEE, 1995.
    • (1995) IEEE
    • Wang, P.-C.1    Korfhage, W.2
  • 8
    • 62949150233 scopus 로고
    • Efficient multiprocessor scheduling based on genetic algorithms
    • E. S. H. Hou, R. Hong, and N. Ansari, "Efficient Multiprocessor Scheduling Based On Genetic Algorithms", IEEE, 1990.
    • (1990) IEEE
    • Hou, E.S.H.1    Hong, R.2    Ansari, N.3
  • 10
    • 0016313256 scopus 로고
    • A comparison of list schedules for parallel processing systems
    • Adam TL, Chandy KM, Dicksoni JR. "A comparison of list schedules for parallel processing systems". Communications of the ACM 1974;17(12):685-90.
    • (1974) Communications of the ACM , vol.17 , Issue.12 , pp. 685-690
    • Adam, T.L.1    Chandy, K.M.2    Dicksoni, J.R.3
  • 18
    • 34548382975 scopus 로고    scopus 로고
    • A comparison of multiprocessor task scheduling algorithms with communication costs
    • Reakook Hwang, Mitsuo Gen, Hiroshi Katayama, 35 (2008)
    • Reakook Hwang, Mitsuo Gen, Hiroshi Katayama, " A comparison of multiprocessor task scheduling algorithms with communication costs" ScineceDirect, Computers & Operations Research 35 (2008) 976-993, 2008.
    • (2008) ScineceDirect, Computers & Operations Research , pp. 976-993
  • 21
    • 0004116989 scopus 로고    scopus 로고
    • Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0- 262-03293-7. Section 31.3: Modular arithmetic
    • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein." Introduction to Algorithms", Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0- 262-03293-7. Section 31.3: Modular arithmetic, pp.862-868, 2001.
    • (2001) Introduction to Algorithms , pp. 862-868
    • Cormen, T.H.1    Leiserson, C.E.2    Rivest, R.L.3    Stein, C.4


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