A noble routing algorithm for the internet computational GRID

Youngyong Kim

doi:10.1007/3-540-45639-2_4

A noble routing algorithm for the internet computational GRID

Youngyong Kim

Department of Electrical and Electronic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Computational Grid has become widespread and lead the way to high-performance computation using widely dispersed resources. The computational GRID architecture is very dynamic by nature with its distributed resources over many organizations, its heterogeneous resources, and pervasive availability with variety of tools. For the best performance of GRID computing, it is inevitable to find computational resources not only based on the computational availability but also based on the communication delay between server and client. In this paper, we suggest a noble routing protocol for the GRID computing based on communication delay. Our approach shows dramatic decrease on the overall computation time.

Original language	English
Title of host publication	Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings
Editors	Whie Chang
Publisher	Springer Verlag
Pages	33-37
Number of pages	5
ISBN (Print)	3540439684, 9783540439684
DOIs	https://doi.org/10.1007/3-540-45639-2_4
Publication status	Published - 2002
Event	1st International Workshop on Advanced Internet Services and Applications, AISA 2002 - Seoul, Korea, Republic of Duration: 2002 Aug 1 → 2002 Aug 2

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2402
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st International Workshop on Advanced Internet Services and Applications, AISA 2002
Country	Korea, Republic of
City	Seoul
Period	02/8/1 → 02/8/2

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45639-2_4

Fingerprint Dive into the research topics of 'A noble routing algorithm for the internet computational GRID'. Together they form a unique fingerprint.

Cite this

Kim, Y. (2002). A noble routing algorithm for the internet computational GRID. In W. Chang (Ed.), Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings (pp. 33-37). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2402). Springer Verlag. https://doi.org/10.1007/3-540-45639-2_4

@inproceedings{85b921b5ebd24b8da9dcaf9e117a557a,

title = "A noble routing algorithm for the internet computational GRID",

abstract = "Computational Grid has become widespread and lead the way to high-performance computation using widely dispersed resources. The computational GRID architecture is very dynamic by nature with its distributed resources over many organizations, its heterogeneous resources, and pervasive availability with variety of tools. For the best performance of GRID computing, it is inevitable to find computational resources not only based on the computational availability but also based on the communication delay between server and client. In this paper, we suggest a noble routing protocol for the GRID computing based on communication delay. Our approach shows dramatic decrease on the overall computation time.",

author = "Youngyong Kim",

year = "2002",

doi = "10.1007/3-540-45639-2_4",

language = "English",

isbn = "3540439684",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "33--37",

editor = "Whie Chang",

booktitle = "Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings",

address = "Germany",

note = "1st International Workshop on Advanced Internet Services and Applications, AISA 2002 ; Conference date: 01-08-2002 Through 02-08-2002",

}

Kim, Y 2002, A noble routing algorithm for the internet computational GRID. in W Chang (ed.), Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2402, Springer Verlag, pp. 33-37, 1st International Workshop on Advanced Internet Services and Applications, AISA 2002, Seoul, Korea, Republic of, 02/8/1. https://doi.org/10.1007/3-540-45639-2_4

A noble routing algorithm for the internet computational GRID. / Kim, Youngyong.

Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings. ed. / Whie Chang. Springer Verlag, 2002. p. 33-37 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2402).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A noble routing algorithm for the internet computational GRID

AU - Kim, Youngyong

PY - 2002

Y1 - 2002

N2 - Computational Grid has become widespread and lead the way to high-performance computation using widely dispersed resources. The computational GRID architecture is very dynamic by nature with its distributed resources over many organizations, its heterogeneous resources, and pervasive availability with variety of tools. For the best performance of GRID computing, it is inevitable to find computational resources not only based on the computational availability but also based on the communication delay between server and client. In this paper, we suggest a noble routing protocol for the GRID computing based on communication delay. Our approach shows dramatic decrease on the overall computation time.

AB - Computational Grid has become widespread and lead the way to high-performance computation using widely dispersed resources. The computational GRID architecture is very dynamic by nature with its distributed resources over many organizations, its heterogeneous resources, and pervasive availability with variety of tools. For the best performance of GRID computing, it is inevitable to find computational resources not only based on the computational availability but also based on the communication delay between server and client. In this paper, we suggest a noble routing protocol for the GRID computing based on communication delay. Our approach shows dramatic decrease on the overall computation time.

UR - http://www.scopus.com/inward/record.url?scp=84949450311&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949450311&partnerID=8YFLogxK

U2 - 10.1007/3-540-45639-2_4

DO - 10.1007/3-540-45639-2_4

M3 - Conference contribution

AN - SCOPUS:84949450311

SN - 3540439684

SN - 9783540439684

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 37

BT - Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings

A2 - Chang, Whie

PB - Springer Verlag

T2 - 1st International Workshop on Advanced Internet Services and Applications, AISA 2002

Y2 - 1 August 2002 through 2 August 2002

ER -

Kim Y. A noble routing algorithm for the internet computational GRID. In Chang W, editor, Advanced Internet Services and Applications - 1st International Workshop, AISA 2002, Proceedings. Springer Verlag. 2002. p. 33-37. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45639-2_4