跳到主要內容

臺灣博碩士論文加值系統

(18.97.9.169) 您好!臺灣時間:2025/02/18 02:06
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:廖筱芸
研究生(外文):Hsiao-Win Liao
論文名稱:在即時系統中提出多重目標的配置方法
論文名稱(外文):Multi-Objective Placement of Reconfigurable Hardware Tasksin Real-Time Systems
指導教授:熊博安熊博安引用關係
指導教授(外文):Pao-Ann Hsiung
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊工程所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:96
語文別:英文
論文頁數:53
中文關鍵詞:配置低碎裂最小化繞線成本多重目標即時工作
外文關鍵詞:Multi-objectiveminimization of routing costPlacementreal-time tasklow fragmentationreconfigurable computingFPGA
相關次數:
  • 被引用被引用:0
  • 點閱點閱:262
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
動態可重組系統提供了部份重組的弁遄A允陬w體工作被切換進來跟切換出去時不會影響其他正在執行的可重組硬體邏輯。然而硬體工作重組需要被配置在可以被重組的邏輯之中。讓硬體工作有效率的執行以及有效的資源使用是需要被管理的。釵h的演算法只有提及針對一種目標作配置空間的管理例如最小化繞線資源、最小化碎裂空間。這些目標大多會衝突,然而它們都是需要。工作之間的溝通會被已經在執行的工作所影響。最小化繞線資源的配置器並沒有考慮到空間碎裂問題。最小化碎裂空間並沒有考慮繞線資源的使用。因此我們提出一個多重目標的配置方法(MOHP)。此方法與共用基礎的排程器類似,這種排程器是針對不同的排程方法去調整處理器的頻寬使用率。而我們是針對不同的配置方法之間的衝突提出一些經驗規則。
Dynamically reconfigurable computing systems (DRCS) provides partial reconfiguration to allow a hardware task to be swapped in and out without influencing other executing tasks in the reconfigurable hardware logic. However, hardware task
configurations need to be placed into the reconfigurable logic. Efficient execution of hardware tasks and effective resource usage result in the need of a placement manager. Many algorithms have been presented for hardware placement, with different goals such as low fragmentation, and minimization of routing costs. The goals are often conflicting, however they are mostly desirable. The communication between tasks would be affected by other placed tasks. The placement for minimization of fragmentation does not consider the routing problem. The placement for minimization of routing resource does not consider fragmentation of free space. In this work, we propose a multi-objective hardware placement (MOHP) strategy which is similar to share-based schedulers that try to adjust resource utilization among different scheduling methods by varying the loading of processor bandwidth. We develop
heuristics for solving the conflicts among these placement methods. We find that our placement method performance is mostly nearby the best assessment criteria.
1 Introduction
1.1 The Target
1.2 Background
1.3 Motivation
1.4 Thesis Organization
2 PreviousWork
3 Preliminaries
3.1 System Model
3.2 Task Model
3.3 Illustration Example
3.4 Assumptions
3.5 Problem Formulation
4 Placement Algorithm
4.1 Space Management
4.2 First Fit Placement Algorithm (FF)
4.3 Placement for Minimization of Routing Resources (MR)
4.4 Placement for Minimization of Fragmentation (MF)
4.5 Multi-Objective Hardware Placement
4.6 Decreasing of Rejection Rate
5 Simulation Experiments
5.1 Experiment Setup
5.2 Experiments with Random Data
5.3 Experiments with Real Data
6 Conclusions
[1] Xilinx Device Families. Technical report, Xilinx, 2005.
[2] A. Ahmadinia, C. Bobda, M. Bednara, and J. Teich. A New Approach for On-line Placement on Reconfigurable Devices. In Proceedings on the Parallel and Distributed Processing Symposium, volume 4, page 134. IEEE CS Press, April 2004.
[3] A. Ahmadinia, C. Bobda, and J. Teich. Online Placement for Dynamically Reconfigurable Devices. International Journal of Embedded Systems, 1(3-4):165–178, June 2006.
[4] K. Bazargan, R. Kastner, and M. Sawafzadeh. Fast Template Placement for Reconfigurable Computing Systems. IEEE Design and Test of Computers, 17(1):68–83, January 2000.
[5] G. J. Brebner. A Virtual Hardware Operating System for the Xilinx XC6200. In Proceedings of the 6th International Workshop on Field-Programmable Logic, Smart Applications,New Paradigms and Compilers, volume 1142, pages 327–336, London, UK, September 1996.Springer-Verlag.
[6] J. Burns, A. Donlin, J. Hogg, S. Singh, and M. De Wit. A Dynamic Reconfiguration Run-Time System. In Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines, pages 66–75, Washington, DC, USA, April 1997. IEEE Computer Society.
[7] K. Compton, Z. Li, J. Cooley, S. Knol, and S. Hauck. Configuration Relocation and Defragmentation for Run-Time Reconfigurable Computing. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 10(3):209–220, June 2002.
[8] P. Goyal, X. Guo, and H. M. Vin. A Hierarchical CPU Scheduler for Multimedia Operating Systems. Readings in Multimedia Computing and Networking, pages 491–505, 2001.
[9] V. G. Gudise and G. K. Venayagamoorthy. FPGA Placement and Routing Using Particle Swarm Optimization. In Proceedings of IEEE Computer Society Annual Symposium on VLSI, pages 307–308. IEEE CS Press, February 2004.
[10] M. Handa and R. Vemuri. An Efficient Algorithm for Finding Empty Rectangles for Online FPGA Placement. In Proceedings of the Design Automation Conference, pages 960 – 965. ACM Press, June 2004.
[11] M. Handa and R. Vemuri. Hardware Assisted Two Dimensional Ultra Fast Online Placement. International Journal of Embedded Systems (IJES), 1:291–299, June 2006.
[12] C.-H. Huang, K.-J. Shih, C.-S. Lin, S.-S. Chang, and P.-A. Hsiung. Dynamically Swappable Hardware Design in Partially Reconfigurable Systems. In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), pages 2742–2745, May 2007.
[13] J.-Y. Mignolet, V. Nollet, P. Coene, D. Verkest, S. Vernalde, and R. Lauwereins. Infrastructure for Design and Management of Relocatable Tasks in a Heterogeneous Reconfigurable Systemon-Chip. In Proceedings of the Design Automation and Test in Europe (DATE), pages 986–991. IEEE CS Press, March 2003.
[14] P. Sedcole, B. Blodget, T. Becker, J. Anderson, and P. Lysaght. Modular dynamic reconfiguration in Virtex FPGAs. IEE Proceedings Computers and Digital Techniques, 153(3):157–164,May 2006.
[15] C. Steiger, H.Walder, and M. Platzner. Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks. IEEE Transactions on Computers, 53:1392–1407, November 2004.
[16] C. Steiger, H. Walder, M. Platzner, and L. Thiele. Online Scheduling and Placement of Realtime Tasks to Partially Reconfigurable Devices. In Proceedings of the 24th IEEE International Real-Time Systems Symposium, page 224. IEEE CS Press, December 2003.
[17] J. Tabero, J. Septien, H. Mecha, and D. Mozos. A Low Fragmentation Heuristic for Task Placement in 2D RTR HW Management. In Proceeding of the Field Programmable Logic and Application, pages 241–250. Springer Verlag, August-September 2004.
[18] J. Tabero, J. Septien, H. Mecha, and D. Mozos. Task Placement Heuristic Based on 3DAdjacency and Look-Ahead in Reconfigurable Systems. In Proceedings of the Asia South Pacific Design Automation Conference, pages 24–27. ACM Press, January 2006.
[19] J. Tabero, J. Septien, H. Mecha, D. Mozos, and S. Roman. A vertex-list approach to 2D HW multitasking management in RTR FPGAs. In Proceeding of the Design of Circuits and Integrated Systems Conference, pages 545–550. Ciudad Real, November 2003.
[20] H. Walder and M. Platzner. Online Scheduling for Block-partitioned Reconfigurable Devices. In Design, Automation and Test in Europe Conference and Exhibition, volume 01, pages 290–295, Los Alamitos, CA, USA, March 2003. IEEE CS Press.
[21] H. Walder, C. Steiger, and M. Platzner. Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-hashing. In Proceedings on Parallel and Distributed Processing Symposium, volume 17, page 8, Los Alamitos, CA, USA, April 2003. IEEE CS Press.
[22] G. Wigley and D. Kearney. The Development of an Operating System for Reconfigurable Computing. In Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pages 249–250. IEEE CS Press, 2001.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top