多伺服器環境下以記憶體重複使用為考量的使用者分配之研究

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：8

、訪客IP：3.136.18.121

姓名

林明德(Ming-Te Lin) 查詢紙本館藏

畢業系所

企業管理學系

論文名稱

多伺服器環境下以記憶體重複使用為考量的使用者分配之研究
(User Distributions in multiple-server platform with the consideration of User balancing and memory reusability.)

相關論文

★ 在社群網站上作互動推薦及研究使用者行為對其效果之影響	★ 以AHP法探討伺服器品牌大廠的供應商遴選指標的權重決定分析
★ 以AHP法探討智慧型手機產業營運中心區位選擇考量關鍵因素之研究	★ 太陽能光電產業經營績效評估－應用資料包絡分析法
★ 建構國家太陽能電池產業競爭力比較模式之研究	★ 以序列採礦方法探討景氣指標與進出口值的關聯
★ ERP專案成員組合對績效影響之研究	★ 推薦期刊文章至適合學科類別之研究
★ 品牌故事分析與比較-以古早味美食產業為例	★ 以方法目的鏈比較Starbucks與Cama吸引消費者購買因素
★ 探討創意店家創業價值之研究- 以赤峰街、民生社區為例	★ 以領先指標預測企業長短期借款變化之研究
★ 應用層級分析法遴選電競筆記型電腦鍵盤供應商之關鍵因子探討	★ 以互惠及利他行為探討信任關係對知識分享之影響
★ 結合人格特質與海報主色以類神經網路推薦電影之研究	★ 資料視覺化圖表與議題之關聯

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

由於網際網路的蓬勃發展,使用網路服務的人口迅速地增加,因此必須使用更多的伺服器(Application Server)同時提供服務,來滿足大量的服務需求。但相對的,同時使用多台伺服器若不能有效地提供負載平衡(load balancing),會造成有些伺服器過載或者閒置,因而導致服務品質的不佳。系統中伺服器個數的多寡將是資源配置的主要考慮因素,因此,該如何在資源有限的情況下發揮最大的經濟效益,一直都是企業營運的目標之一。
本研究目的是以 LAPO(Load Adjusted Profile Oriented User Allocation Algorithm)演算法改善 POCA(Profile Oriented Clustering Algorithm)演算法在求取最佳組合解時,必須耗費大量的計算時間,以及能對使用者在 Application server 分配上更均勻,確實達到 load balancing 之目的。由於 LAPO 在有設置條件的情況下,能有效的掌控 Application server 所分配的使用者個數,因此能減少計算最佳組合解的次數,有效地增進執行效率。實驗數據來自 SAP ERP ECC 6.0 系統,並且在實際驗證過後,確定 LAPO 的效率較好、結果更符合企業運用的實際情境。

摘要(英)

Due to the rapid growth of internet in popularity and size, internet traffics have increased significantly. In order to fulfill the vast web service demands, more and more application servers need to be hosted simultaneously. However, without utilizing load balance effectively, the use of multiple sever hosting will not only reduce the quality of services but also decrease the utilization of system. Therefore, how to allocate limited resources in order to optimize the performance of the system becomes a major concern for companies.
The first objective of this paper is to clarify the characteristics of each end user in the system according to their historical logging data, such as user’s transaction data and the system resources consume by this transaction. We used SAP system as our research platform and the data sets were extracted from National Central University’s SAP systems. Detail of the framework and the procedure of this research are illustrated in Chapter 3.
The second objective of this paper is to improve the POCA（Profile Oriented Clustering Algorithm）by applying LAPO（Load Adjusted Profile Oriented User Allocation Algorithm）. LAPO can monitor and control the number of users in each application servers more effectively than POCA which enable LAPO to reduce huge amount of calculation time. As such, LAPO make distribution of users much more evenly and efficiency which also can help multiple server systems to achieve better load balancing.

關鍵字(中)

★ 負載平衡
★ ERP 作業選項
★ 效能評估

關鍵字(英)

★ Performance evaluation
★ Transaction
★ Load balancing

論文目次

摘要 i
Abstract ii
第一章緒論 1

1-1 研究背景與動機 1
1-2 研究目的 2
1-3 論文架構 3

第二章文獻探討 4
2-1 Web Application Server Architecture 4
2-2 Distributed Computing System and Load Balancing 5
2-3 Profile Oriented Clustering Algorithm 8
2-4 User Distributions in Enterprise System 8

第三章演算法分析 10
3-1 Finding Users’Regular Transactions 10
3-2 Profile Oriented Clustering Algorithm (POCA) 13
3-3 Clustering and Distributing by Load Adjusted Profile Oriented User Allocation Algorithm 15

第四章實作結果分析 20
4-1 資料描述與前處理 20
4-2 實驗模擬與分析 22
4-3 實驗結果驗證與比較 23

第五章結論與未來研究議題 27
5-1 結論 27
5-2 未來研究與建議 27

參考文獻 28

參考文獻

1. SAP, TADM10_1 : SAP NetWeaver AS Implementation & Operation 1, 2008.
2. Saeed Sharifian, Seyed A. Motamedi, Mohammad K. Akbari, “A content-based load balancing algorithm with admission control for cluster web servers”, Future Generation Computer Systems, 24, pp.775–787, 2008.
3. SAP, TADM10_2 : SAP NetWeaver AS Implementation & Operation 1, 2008.
4. P. Krueger and R. Chawla,“The Stealth Distributed Schedular”, Procedding 11th Int’l Conference Distributed Computing Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 2144, pp. 336-343, May 1991.
5. M. Livny and M. Melman, “Load Balancing in Homogeneous Broadcast Distributed Systems”, Computer Network Performance Symposium, pp. 336-343, May 1991.
6. Zhan Huang, Biao Liang,“A New Content-Aware Dynamic Load Balancing Algorithm for Web Server Clusters”, Sciverse ScienceDirect, December 2011.
7. M. Sriram Iyengar, Mukesh Singhal, “Effect of network latency on load sharing in distributed systems”, Sciverse ScienceDirect, J. Parallel Distrib. Comput., 66, pp.839–853, 2006.
8. Ting, Ping-Ho, ”A Research of User Distributions in Enterprise Systems”, Universal Computer Science, Volume: 12, Issue: 2,pp.160-186,2006.
9. Junehwa Song, Arun Iyengar, Eric Levy-Abegnoli, Daniel Dias, “ Architecture of a Web server accelerator”, Computer Networks, 38, pp.75-97, 2002.
10. J. Challenger, P. Dantzig, A. Iyengar, “A scalable and highly available system for serving dynamic data at frequently accessed websites”, ProceedingsofACM/IEEE SC98, November1998.
11. J.Challenger,A.Iyengar,P.Dantzig, “A scalable system for consistently caching dynamic web data”, Proceedings of IEEE INFOCOM’’99, March 1999.
12. A. Iyengar, J. Challenger, “Improving web server perfor- mance by caching dynamic data”, Proceedings of the USENIX Symposiumon Internet
Technologies and Systems, December 1997. 13. Bacel Maddah, Muhammad El-Taha, Roy Abou Tayeh, “Optimal
allocation of servers and processing time in a load balancing system”, Computers & Operations Research, 37, pp. 2173–2181, 2010.
14. Zahir Tari, James Broberg, Albert Y. Zomayab, Roberto Baldoni, “A least flow-time first load sharing approach for distributed server farm”, science direct, 65, pp. 832–842, 2005.
15. Saeed Sharifian, Seyed A. Motamedi, Mohammad K. Akbari, “A predictive and probabilistic load-balancing algorithm for cluster-based web servers”, ScienceDirect, Applied Soft Computing 11, pp. 970–981, 2011.
16. E. Casalicchio, V. Cardellini, M. Colajanni, “Content-aware dispatching algorithms for cluster-based web servers”, Cluster Computing 5, pp.65–74, 2002.

指導教授

許秉瑜(Ping-yu Hsu)

審核日期

2012-6-7

推文