完整後設資料紀錄
DC 欄位語言
dc.contributor.author謝萬熹en_US
dc.contributor.authorWan-Hsi Hsiehen_US
dc.contributor.author周景揚en_US
dc.contributor.authorJing-Yang Jouen_US
dc.date.accessioned2014-12-12T02:26:09Z-
dc.date.available2014-12-12T02:26:09Z-
dc.date.issued2004en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT009211681en_US
dc.identifier.urihttp://hdl.handle.net/11536/67579-
dc.description.abstract網路單晶片是為了應付未來極為複雜的系統單晶片的通訊需求所提出的一種新的設計方式,在這篇論文中,我們提出一個基於基因演算法的任務排程方法把應用排程至一個使用異質性網路單晶片,這個任務排程方法試著去為每一個任務找到最適合的處理器,使得系統的資料處理率提升至最大。在基因演算法中,我們考慮到應用中的特性,而提出了一個新的交配運算元,藉此提升基因演算法的效能,實驗結果顯示了我們所提出的交配運算元的效能較傳統的還要好上平均10%,而在基因演算法的運算時間方面也較使用傳統交配運算元還要快。zh_TW
dc.description.abstractNetwork-on-Chip is a new design paradigm to meet the communication requirement of future billion-transistor System-on-Chip. In this thesis, we propose a genetic algorithm (GA) based task scheduling technique to schedule the applications to the heterogeneous Network-on-Chip. The task scheduling process attempts to arrange the allocation of processor for each task such that the system throughput is maximized. As well, a new mating operator of GA is also proposed to improve the performance of traditional GA by considering the characteristics of application. The experimental results show that proposed mating operator not only outperforms traditional ones by 10% averagely, but also requires less computation time.en_US
dc.language.isoen_USen_US
dc.subject任務排程zh_TW
dc.subject基因演算法zh_TW
dc.subject網路單晶片zh_TW
dc.subject系統單晶片zh_TW
dc.subject多處理器系統單晶片zh_TW
dc.subjecttask schedulingen_US
dc.subjectgenetic algorithmsen_US
dc.subjectNetwork-on-Chipen_US
dc.subjectSystem-on-Chipen_US
dc.subjectMPSoCen_US
dc.title基於基因演算法應用於異質性網路單晶片之任務排程方法zh_TW
dc.titleGA-Based Task Scheduling for Heterogeneous Network-on-Chipen_US
dc.typeThesisen_US
dc.contributor.department電子研究所zh_TW
顯示於類別:畢業論文


文件中的檔案:

  1. 168101.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。