Добірка наукової літератури з теми "Routing Deadlocks"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Routing Deadlocks".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Routing Deadlocks"
Verma, Renu, Mohammad Ayoub Khan, and Amit Zinzuwadiya. "Power and Latency Optimized Deadlock-Free Routing Algorithm on Irregular 2D Mesh NoC using LBDRe." International Journal of Embedded and Real-Time Communication Systems 4, no. 2 (April 2013): 36–49. http://dx.doi.org/10.4018/jertcs.2013040102.
Повний текст джерелаRomanov, Aleksandr Y., Nikolay M. Myachin, Evgenii V. Lezhnev, Alexander D. Ivannikov, and Ahmed El-Mesady. "Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip." Micromachines 14, no. 1 (January 5, 2023): 141. http://dx.doi.org/10.3390/mi14010141.
Повний текст джерелаKHONSARI, A., H. SARBAZI-AZAD, and M. OULD-KHAOUA. "A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes." Parallel Processing Letters 15, no. 01n02 (March 2005): 153–68. http://dx.doi.org/10.1142/s012962640500212x.
Повний текст джерела., Elavarasi, and G. Raja. "A Necessary and Sufficient Condition for Deadlock-Free Message Routing in Communication Networks." International Journal of Advance Research and Innovation 3, no. 2 (2015): 23–26. http://dx.doi.org/10.51976/ijari.321506.
Повний текст джерелаKHONSARI, A., A. SHAHRABI, and M. OULD-KHAOUA. "A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS." Parallel Processing Letters 17, no. 02 (June 2007): 213–28. http://dx.doi.org/10.1142/s0129626407002971.
Повний текст джерелаShrivastava, Anurag, and Sudhir Kumar Sharma. "Efficient bus based router for NOC architecture." World Journal of Engineering 13, no. 4 (August 1, 2016): 370–75. http://dx.doi.org/10.1108/wje-08-2016-049.
Повний текст джерелаBoppana, R. V., S. Chalasani, and C. S. Raghavendra. "Resource deadlocks and performance of wormhole multicast routing algorithms." IEEE Transactions on Parallel and Distributed Systems 9, no. 6 (June 1998): 535–49. http://dx.doi.org/10.1109/71.689441.
Повний текст джерелаDimopoulos, N. J., and R. Sivakumar. "Deadlock-preventing routing in hypercycles." Canadian Journal of Electrical and Computer Engineering 19, no. 4 (October 1994): 193–99. http://dx.doi.org/10.1109/cjece.1994.6591123.
Повний текст джерелаFlammini, Michele. "Deadlock-free interval routing schemes." Networks 34, no. 1 (August 1999): 47–60. http://dx.doi.org/10.1002/(sici)1097-0037(199908)34:1<47::aid-net5>3.0.co;2-3.
Повний текст джерелаWU, JIE, and LI SHENG. "DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING." Parallel Processing Letters 13, no. 04 (December 2003): 705–20. http://dx.doi.org/10.1142/s0129626403001616.
Повний текст джерелаДисертації з теми "Routing Deadlocks"
Kinsy, Michel A. "Application-aware deadlock-free oblivious routing." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53316.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (p. 67-71).
Systems that can be integrated on a single silicon die have become larger and increasingly complex, and wire designs as communication mechanisms for these systems on chip (SoC) have shown to be a limiting factor in their performance. As an approach to remove the limitation of communication and to overcome wire delays, interconnection networks or Network-on-Chip (NoC) architectures have emerged. NoC architectures enable faster data communication between components and are more scalable. In designing NoC systems, there are three key issues; the topology, which directly depends on packaging technology and manufacturing costs, dictates the throughput and latency bounds of the network; the flit control protocol, which establishes how the network resources are allocated to packets exchanged between components; and finally, the routing algorithm, which aims at optimizing network performance for some topology and flow control protocol by selecting appropriate paths for those packets. Since the routing algorithm sits on top of the other layers of design, it is critical that routing is done in a matter that makes good usage of the resources of the network. Two main approaches to routing, oblivious and adaptive, have been followed in creating routing algorithms for these systems. Each approach has its pros and cons; oblivious routing, as opposite to adaptive routing, uses no network state information in determining routes at the cost of lower performance on certain applications, but has been widely used because of its simpler hardware requirements.
(cont.) This thesis examines oblivious routing schemes for NoC architectures. It introduces various non-minimal, oblivious routing algorithms that globally allocate network bandwidth for a given application when estimated bandwidths for data transfers are provided, while ensuring deadlock freedom with no significant additional hardware. The work presents and evaluates these oblivious routing algorithms which attempt to minimize the maximum channel load (MCL) across all network links in an effort to maximize application throughput. Simulation results from popular synthetic benchmarks and concrete applications, such as an H.264 decoder, show that it is possible to achieve better performance than traditional deterministic and oblivious routing schemes.
by Michel A. Kinsy.
S.M.
Lehman, Eric (Eric Allen) 1970. "Deadlock-free routing in a faulty hypercube." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47503.
Повний текст джерелаHolsmark, Rickard. "Deadlock Free Routing inMesh Networks on Chip with Regions." Licentiate thesis, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-20284.
Повний текст джерелаThere is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structureson silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. Design complexity ofthese Systems on Chip (SoC) is reduced by the use of pre-designed cores. However, several problems related to the interconnection of coresremain. Network on Chip (NoC) is a new SoC design paradigm, which targets the interconnect problems using classical network concepts. Still,SoC cores show large variance in size and functionality, whereas several NoC benefits relate to regularity and homogeneity.
This thesis studies some network aspects which are characteristic to NoC systems. One is the issue of area wastage in NoC due to cores of varioussizes. We elaborate on using oversized regions in regular mesh NoC and identify several new design possibilities. Adverse effects of regions oncommunication are outlined and evaluated by simulation.
Deadlock freedom is an important region issue, since it affects both the usability and performance of routing algorithms. The concept of faultyblocks, used in deadlock free fault-tolerant routing algorithms has similarities with rectangular regions. We have improved and adopted one suchalgorithm to provide deadlock free routing in NoC with regions. This work also offers a methodology for designing topology agnostic, deadlockfree, highly adaptive application specific routing algorithms. The methodology exploits information about communication among tasks of anapplication. This is used in the analysis of deadlock freedom, such that fewer deadlock preventing routing restrictions are required.
A comparative study of the two proposed routing algorithms shows that the application specific algorithm gives significantly higher performance.But, the fault-tolerant algorithm may be preferred for systems requiring support for general communication. Several extensions to our work areproposed, for example in areas such as core mapping and efficient routing algorithms. The region concept can be extended for supporting reuse ofa pre-designed NoC as a component in a larger hierarchical NoC.
Kachru, Rajiv Carleton University Dissertation Computer Science. "Performance of some deadlock prevention routing algorithms for multicomputer systems." Ottawa, 1992.
Знайти повний текст джерелаHolsmark, Rickard. "Deadlock Free Routing in Mesh Networks on Chip with Regions." Licentiate thesis, Linköping : Department of Compuuter and Information Science, Linköpings universitet, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-20284.
Повний текст джерелаKhonsari, Ahmad. "Performance modelling and analysis of deadlock recovery routing algorithms in multicomputer interconnection networks." Thesis, University of Glasgow, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.398647.
Повний текст джерелаDomke, Jens. "Routing on the Channel Dependency Graph:." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902.
Повний текст джерелаCastillo, Ernesto Cristopher Villegas. "DyAFNoC: sistema dinamicamente reconfigurável baseado em redes intrachip com algoritmo de roteamento ordenado por dimensão flexibilizado." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3140/tde-31122015-101031/.
Повний текст джерелаThe increased capacity of Systems on-Chip (SoCs) has led Networks on-Chip (NoC) to be used as communication interface for processing modules of complex systems, and particularly in Dynamically Recongurable Systems to be implemented over partially recongurable FPGAs. Some reconguration strategies work on irregular and indirect NoCs, fact that forces the system to update its routing algorithm in order to avoid data communication problems, such as deadlockandlivelock. ThispaperpresentsaDynamicallyRecongurableNoC(DRNoC)using Flexible Dimension Order Routing Algorithm (FDOR), mainly characterized by its simplicity, low complexity and deadlock freedom In this work, the DyAFNoC tool was implemented, to generate the VHDL code of the associated NoC architecture to be used with specic applications with dynamic partial reconguration that require parallel communications between their processing modules. This tool generates routers, processing modules, and also a Partial Dynamic Reconguration Control System that can be used with the FDOR-based Reconguration System, developed elsewhere. The tool also generates testbench components for the system simulation, based on the Dynamic Circuit Switching technique that uses isolation switches to emulate the dynamic partial reconguration processes. The results of these experiments have helped to determine the desired system behavior. Simulations of the FDOR implementation were also made in high level descriptioninordertodetermineitsdatatransferperformancethatwillhelptodeneplacement of the processing modules over the network structure. The experiments results have demonstrated the feasibility of this strategy, leading to the conclusion that the FDOR algorithm is a suitable solution for DRNoC.
Domke, Jens [Verfasser], Wolfgang E. [Akademischer Betreuer] [Gutachter] Nagel, and Tor [Gutachter] Skeie. "Routing on the Channel Dependency Graph: : A New Approach to Deadlock-Free, Destination-Based, High-Performance Routing for Lossless Interconnection Networks / Jens Domke ; Gutachter: Wolfgang E. Nagel, Tor Skeie ; Betreuer: Wolfgang E. Nagel." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://d-nb.info/1135907439/34.
Повний текст джерелаHwang, Gwo-Jen, and 黃國貞. "Deadlock-free Multicast Routing Strategies in Wormhole-routing Hypercube Computers." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/71557479126381282037.
Повний текст джерела國立臺灣科技大學
工程技術研究所
81
The communication latency between nodes of hypercube is a vital factor to the performance of the whole system. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. The deadlock-freeness and the performance improvement are the prin- cipal concern of routing algorithms. Since virtual channel is help to the expedition of message passing, this thesis employs the concept of virtual channel to avoid the deadlock and improve the performance. Deadlock-free multicast routing algorithm on path-like model is proposed. The simulation results indicate that one-path routing algo- rithm has lower traffic congestion than that of dual-path routing algorithm. Furthermore, it can also reduce the latency significantly, improving communication performance.
Частини книг з теми "Routing Deadlocks"
Al-Dujaily, Ra’ed, Terrence Mak, Fei Xia, Alex Yakovlev, and Maurizio Palesi. "Run-Time Deadlock Detection." In Routing Algorithms in Networks-on-Chip, 41–68. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8274-1_3.
Повний текст джерелаvon Praun, Christoph, Christoph von Praun, Jeremy T. Fineman, Charles E. Leiserson, Efstratios Gallopoulos, Marc Snir, Michael Heath, et al. "Routing (Including Deadlock Avoidance)." In Encyclopedia of Parallel Computing, 1749–56. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_314.
Повний текст джерелаWarnakulasuriya, Sugath, and Timothy Mark Pinkston. "Modeling Message Blocking and Deadlock in Interconnection Networks." In Parallel Computer Routing and Communication, 275–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69352-1_23.
Повний текст джерелаFlammini, Michele. "Deadlock-free interval routing schemes." In Lecture Notes in Computer Science, 351–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0023472.
Повний текст джерелаAgrawal, Nidhi, and C. P. Ravikumar. "Adaptive routing based on deadlock recovery." In Euro-Par’98 Parallel Processing, 981–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0057957.
Повний текст джерелаLópez, P., J. M. Martínez, J. Duato, and F. Petrini. "On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks." In Parallel Computer Routing and Communication, 295–307. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69352-1_24.
Повний текст джерелаAdeane, J., and V. W. Wittorff. "Deadlock Avoidance in the PNNI Routing Protocol." In Converged Networking, 1–12. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-0-387-35673-0_1.
Повний текст джерелаSamman, Faizal Arya, and Thomas Hollstein. "Efficient and Deadlock-Free Tree-Based Multicast Routing Methods for Networks-on-Chip (NoC)." In Routing Algorithms in Networks-on-Chip, 129–59. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8274-1_6.
Повний текст джерелаSwain, Jyotiranjan, and Sumanta Pyne. "Deadlock Detection in Digital Microfluidics Biochip Droplet Routing." In Communications in Computer and Information Science, 242–53. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-5950-7_21.
Повний текст джерелаAdamo, J. M., and N. Alhafez. "Minimal, adaptive and deadlock-free routing for multiprocessors." In Parallel Processing: CONPAR 92—VAPP V, 815–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55895-0_503.
Повний текст джерелаТези доповідей конференцій з теми "Routing Deadlocks"
Lienert, Thomas, and Johannes Fottner. "No More Deadlocks – Applying The Time Window Routing Method To Shuttle Systems." In 31st Conference on Modelling and Simulation. ECMS, 2017. http://dx.doi.org/10.7148/2017-0169.
Повний текст джерелаCazenave, P., M. Khlif-Bouassida, and A. Toguyeni. "Collisions avoidance and deadlocks prevention, for dynamic routing of trains in a railway node." In 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2019. http://dx.doi.org/10.1109/codit.2019.8820580.
Повний текст джерелаOlenev, V. L., and A. A. Karandashev. "METHODS FOR SELECTING THE OPTIMAL CONFIGURATION OF DEADLOCK-FREE ROUTES IN ON-BOARD SPACEWIRE NETWORKS." In Aerospace instrumentation and operational technologies. Saint Petersburg State University of Aerospace Instrumentation, 2021. http://dx.doi.org/10.31799/978-5-8088-1554-4-2021-2-293-302.
Повний текст джерелаRaksapatcharawong, Mongkol, and Timothy Mark Pinkston. "A System Demonstration of Progressive Deadlock Recovery Routing based on Optoelectronic/VLSI Chips." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.othd.18.
Повний текст джерелаAwerbuch, Baruch, Shay Kutten, and David Peleg. "Efficient deadlock-free routing." In the tenth annual ACM symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/112600.112616.
Повний текст джерелаQuintin, Jean-Noel, and Pierre Vigneras. "Transitively Deadlock-Free Routing Algorithms." In 2016 2nd IEEE International Workshop on High-Performance Interconnection Networks in the Exascale and Big-Data Era (HiPINEB). IEEE, 2016. http://dx.doi.org/10.1109/hipineb.2016.10.
Повний текст джерелаChujo, Taichi, Kosei Nishida, and Tatsushi Nishi. "A Conflict-Free Routing Method for Automated Guided Vehicles Using Reinforcement Learning." In 2020 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/isfa2020-9620.
Повний текст джерелаKinsy, Michel A., Myong Hyon Cho, Tina Wen, Edward Suh, Marten van Dijk, and Srinivas Devadas. "Application-aware deadlock-free oblivious routing." In the 36th annual international symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1555754.1555782.
Повний текст джерелаPrisacari, Bogdan, German Rodriguez, Cyriel Minkenberg, and Ramon Beivide Palacio. "Performance implications of deadlock avoidance techniques in torus networks." In 2012 IEEE 13th International Conference on High Performance Switching and Routing (HPSR). IEEE, 2012. http://dx.doi.org/10.1109/hpsr.2012.6260837.
Повний текст джерелаKurbanov, Lev, Ksenia Rozhdestvenskaya, and Elena Suvorova. "Deadlock-Free Routing in SpaceWire Onboard Network." In 2018 22nd Conference of Open Innovations Association (FRUCT). IEEE, 2018. http://dx.doi.org/10.23919/fruct.2018.8468268.
Повний текст джерела