(3.227.235.183) 您好!臺灣時間:2021/04/20 08:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:陳文琪
研究生(外文):Wen-Chi Chen
論文名稱:設計並實作行動代理人排程系統
論文名稱(外文):Design and Implement of a Mobile-Agent Intelligent Schedule Module
指導教授:李強李強引用關係
指導教授(外文):Chiang Lee
學位類別:碩士
校院名稱:國立成功大學
系所名稱:資訊工程學系碩博士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2003
畢業學年度:91
語文別:中文
論文頁數:98
中文關鍵詞:分散式排程行動代理人
外文關鍵詞:distributedschedulemobile agent
相關次數:
  • 被引用被引用:1
  • 點閱點閱:123
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:15
  • 收藏至我的研究室書目清單書目收藏:1
傳統的schedule system運作的環境有兩項最基本的定義,
首先,是static search space;其次是static schedule graph。但是隨著網路技術的進步與分散式處理的成熟,
自然發展出所謂的remote computing架構,在分散式資料庫環境下,大量的資訊存放在網路上不同的主機當中,上述兩項定義便顯得不合理,因此如何讓scheduler能夠有效利用這些分散的資料是本篇論文要解決的問題。
在這一篇論文當中,將提出一種全新的機制來解決傳統的schedule system所無法解決的問題,因此,本篇論文所提出的schedule system具備下列四項特色,首先,是dynamic search space;其次,是dynamic schedule graph;再其次,減少cpu等待的時間;最後,避免overload情況發生。
除此之外,在眾多的schedule system當中,我們再將研究的範圍縮小至利用java-based mobile agent代替使用者在分散式環境下進行空間上的排程工作,而非一般只考慮時間這個單一維度的排程工作。這個機制最大的好處是讓具有intelligent特性的mobile agent自動蒐集各種資訊且動態地找出最佳的schedule result,同時,針對具有可攜帶性或者任何形式的的用戶端皆具有高度的適應性,對於計算能力較差或者網路資源缺乏的用戶端依舊能夠提供高度的運作成效。
Traditional schedule systems work with two de nitions. The First one is static search
space, and the second one is static schedule graph. With the incremental popular of
distributed computing, people develop the remote computing architecture. Because of
a distributed environment, A large number of data distributed in di erent machines on
the internet. The two de nitions above-mentioned seems to be unreasonable. Thus,
the problem we want to solve is to develop a scheduler which is suitable for distributed
environment.
In this paper, we develop a new mechanism to solve the problem. Our schedule
system provides four function. First, is suitable for dynamic search space. Second,
is suitable for dynamic schedule graph. Third, reduce the idle time of CPU. Forth,
avoid system overload. Besides, we minimize our problem to using java-based mobile
agent to provide scheduling service in a distributed environment. The most impor-
tant advantage of this mechanism is, It dispatches intelligent mobile agent search for
requirement data automatically. Then computes all schedule results. The other ad-
vantage of this mechanism is highly capabilities for any portable device, it still provide
clients which lack computing resource and bandwidth for best performance.
abstract iv
Acknowledgements vi
1 Introduction 1
1.1 Motivation . . . . . . . . . . . . . . . . . . . . 3
1.2 Problem Formulation . . . . . . . . . . . . . . . .6
1.3 Contribution . . . . . . . . . . . . . . . . . . . 8
1.4 Document Organization . . . . . . . . . . . . . . .10
2 Related Work 11
2.1 Mobile Agent System . . . . . . . . . . . . . . . .11
2.1.1 multiple-language system . . . . . . . . . . . . 13
2.1.2 java-based system . . . . . . . . . . . . . . . .15
2.2 Mobile Agent Schedule System . . . . . . . . . . . 17
2.2.1 static search space and static schedule graph . .18
2.2.2 static schedule graph and dynamic search space . 20
2.2.3 static search space and dynamic schedule graph . 21
2.2.4 dynamic search space and dynamic schedule graph .22
3 Enviroments and Background 23
4 Mobile Agent Intelligent Scheduling System 26
4.1 System Architecture . . . . . . . . . . . . . . . .26
4.1.1 user device component . . . . . . . . . . . . . .28
4.1.2 schedule server component . . . . . . . . . . . .29
4.1.3 database server component . . . . . . . . . . . .31
4.2 Distributed storage structure . . . . . . . . . . .34
4.2.1 Directed Data Distribution Graph . . . . . . . . 35
4.2.2 Example of distributed storage structure . . . . 36
4.2.3 De nition of distributed storage structure . . . 37
4.2.4 search of distributed storage structure . . . . .38
4.2.5 Insertion and deletion of distributed storage structure 39
4.3 Schedule Module . . . . . . . . . . . . . . . . . .42
4.3.1 Agents of Intelligent Schedule Module . . . . . .42
4.3.2 work flow of scheduling module . . . . . . . . . . . . . . . .44
4.4 supporting data structure . . . . . . . . . . . . .49
4.5 scheduling module algorithm . . . . . . . . . . . .50
4.5.1 SubDG-building Algorithm . . . . . . . . . . . . 51
4.5.2 visiting-order-deciding Algorithm . . . . . . . .54
4.5.3 visiting-order-sequence-merging Algorithm . . . .55
4.5.4 Decision-graph-meerging Algorithm . . . . . . . .55
4.5.5 next-togo-decision Algorithm . . . . . . . . . . 56
4.5.6 query-deciding Algorithm . . . . . . . . . . . . 56
4.5.7 decision-graph-updating Algorithm . . . . . . . .57
5 Implementation of kii''Agent Schedule System . . . . 59
5.1 Platform and Development Tools . . . . . . . . . . 59
5.2 Directed Data Distribution Graph Design . . . . . .59
5.2.1 Generating a Directed Data Distribution Graph . .60
5.2.2 Simulation Environment . . . . . . . . . . . . . 62
5.3 Programming Technique . . . . . . . . . . . . . . .68
5.4 Example . . . . . . . . . . . . . . . . . . . . . .73
5.5 Manual . . . . . . . . . . . . . . . . . . . . . . 89
6 Conclusions and Future Work . . . . . . . . . . . . 93
6.1 Conclusions . . . . . . . . . . . . . . . . . . . .93
6.2 Future Work . . . . . . . . . . . . . . . . . . . .94
Bibliography 95
Resume 98
[1] Holger Peine and Torsten Stolpmann. "The architecture of the Ara
platform for mobile agents," In Proceedings of the First Interna-
tional Workshopo on Mobile Agents(MA ''97), April 1997.
[2] Holger Peine. "Security concepts and implementations for the Ara
mobile agent system," In Proceedings of the Seventh IEEE Work-
shp on Enabling Technologies: Infrastructure for the Collaborative
EnterPrises, June 1998.
[3] Robert S. Gray, David Kotz, George Cybenko, and Daniela Rus.
D''Agents: Security in a multiple-language, mobile-agent ststem,
1998.
[4] Dag Johansen, Fred B. Schneider, and Robbert van Re-
ness. Operating system support for mobile agents, Addison Wes-
ley, 1998.
[5] Dag Johansen, Fred B. Schneider, and Robbert van Renesse.
What TACOMA taught us, Addison Wesley, 1998.
[6] Danny B. Lange and Mitsuru Oshima.
Programming and Deploying Java mobile agents with Aglets,
Addison Wesley, 1998.
95
[7] Danny B. Lange and Daniel T. Chang. "IBM Aglets Workbench:
Programming mobile agents in Java," IBM Wite Paper, 1996.
[8] David Wong, Noemi Paciorek, Tom Walsh, Joe DiCelie, Mike
Young, and Bill Peet. "Concordia:An infrastructure for collabo-
rating mobile agents," In Proceedings of the First INternational
Workshop on Mobile Agents(MA ''97), pages 86-97, 1997.
[9] Tom Walsh, Noemi Paciorek, and David Wong. "Security and re-
liability in concordia," In Proceedings of the Thirty- rst Annual
Hawaii International Conference on System Sciences, volume VII,
pages 44-53, January 1998.
[10] Ad Astra Engineering. Jumping Beans white paper, September 1,
1998. See http://www.JumpingBeans.com
[11] Weiming Shen. " Distributed Manufacturing Scheduling Using In-
telligent Agents," In Intelligent System, volumn 17, number 1,
pages 88-94, February 2002.
[12] D. Jonansen. "Mobile Agent Applicability," In Proceedings of the
Mobile Agents, 1998.
[13] Roch Glitho, Edgar Olougouna and Samuel Pierre. "Mobile Agents
and their Use for Information Retrieval: A Brief Overview and an
Elaborate Case Study," IEEE Network Magazine, Vol. 16, No. 1,
Jan./Feb. 2002, pp. 34-41.
[14] Brian Brewington, Robert Gray, Katsuhiro Moizumi, David Kotz,
George Cybenko and Daniela Rus. Intelligent Information Agents,
1999.
96
[15] Jaeyoung Yang, Joongmin Choi, Joongbae Kim and Hosang Han.
"a more scalable comparison-shopping agent," InProceedings of the
fth international conference on Autonomous agents, May 2001.
[16] Robert B. Goorenbos, Oren Etzioni and Daniel S. Weld. "A Scal-
able Comparison-Shopping Agent for the World-Wide Web," In
Proceedings of the First International Conference on Autonomous
Agents, 1997.
[17] Je rey O. Kephart and Amy R. Greenwald. "Shopbot Eco-
nomics," InProceedings of the Third International Conference on
Autonomous Agents, 2000.
[18] Raymond Lau, Arthur H. M. ter Hofstede and Peter D. Bruza.
"Adaptive Pro ling Agents for Electronic Commerce," In Proceed-
ings of the 4th CollECTeR Conference on Electronic Commerce,
April 2000.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 100.賴伯勇(1998):網路文獻的引用初探。教育資料與研究,23,41-50。
2. 98.顏龍源(2000):主題化的電腦融入課程概念。資訊與教育雜
3. 97.顏嘉億(2000):「合作學習」教學之經驗分享。國教天地,138。
4. 96.顏榮泉(1996):媒體發展與遠距教學。視聽教育雙月刊,37(4),
5. 89.劉秀嫚(1998):合作學習的教學策略。公民訓育學報,7,285-294。
6. 78.楊家興(1998):多元化遠距教學。遠距教育期刊,8,62-67。
7. 54.柯怡菁(1999):漫談資訊科技與教育。資訊與教育雜誌,69,62-64。
8. 47.劉寶鈞、張智凱、陳國棟(1997):互動式資料庫設計遠距教學所需的合作式學習活動。遠距教育,2, 22-30。
9. 46.張國恩(1998):資訊科技融入各科教學之內涵與實施。資訊與教育雙月刊(72)。
10. 45.張鈿富(1991):從方法論的省思談質的研究。教育研究雙月刊,2(17),2-31。
11. 44.張振成(1998):遠距教學的新趨勢。高市文教,63,13-15。
12. 38.邱貴發(1996)網路世界中的學習:理念與發展。教育研究資訊,6
13. 16.吳庭瑜、吳明樺、洪瑞雲(1998):合作學習、解釋及發問架構提示對歸納推理表現之影響。中華心理學刊,40(2),117-136。
14. 7.王全世(2000):資訊科技融入教學意義與內涵。資訊與教育雜誌,
15. 6.王智玄(1989):新的學習策略---網路合作是學習知探討。資訊與教育雜誌,78,42-49。
 
系統版面圖檔 系統版面圖檔