Filters








9,858 Hits in 6.5 sec

Deterministic Routing Algorithm for Shared Memory Processing (SMP)

Soha S. Zaghloul, PhD, Ashwag Homod Alotebi, Noura Saleh AL Maghrabi, Asma Abdurahman Almulifi, Hend Ibrahim Alshaya
2017 International Journal Of Engineering And Computer Science  
Parallel computing involves the simultaneous deployment of various resources and computers to solve computational problems by using multiple processors.  ...  Therefore, this paper presents an application of XY deterministic routing in an SMP system based on a 4x4 2D mesh topology network with two cores and two threads per core.  ...  Acknowledgment The authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for its funding this Research group NO (RG-1435-077).  ... 
doi:10.18535/ijecs/v6i6.35 fatcat:3xhll7fadratrl2ufxlarcclsi

Barrier synchronization on wormhole-routed networks

Yuzhong Sun, P.Y.S. Cheung
2001 IEEE Transactions on Parallel and Distributed Systems  
We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled  ...  AbstractÐIn this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree.  ...  Partial funding for this research was provided by Hong Kong RGC 7048/98E and HKU CRCG grant 337/062/0012.  ... 
doi:10.1109/71.932712 fatcat:txhvu7x5vvd6zlpuugz5gbymna

Accelerate FPGA routing with parallel recursive partitioning

Minghua Shen, Guojie Luo
2015 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
The parallel router is implemented using the Message Passing Interface (MPI). Experimental results show that our parallel router ParRoute+ achieves a 7.06× speedup compared to the VPR 7.0 router.  ...  The two potentially conflicting-free subsets are routed in parallel after the first subset is routed. And all subsets are recursively partitioned in the same way.  ...  We invoke multiple processes to complete the partitioned routing tasks, and use message passing interface (MPI) for synchronization and data exchange.  ... 
doi:10.1109/iccad.2015.7372558 dblp:conf/iccad/ShenL15 fatcat:r676tg6fl5gnxcrioydsy2m5qy

Competitive Routing in Hybrid Communication Networks [article]

Daniel Jung, Christina Kolb, Christian Scheideler, Jannik Sundermeier
2018 arXiv   pre-print
Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to  ...  information just has to be known to a few nodes for the routing to work.  ...  Based on that graph, one can use Chew's Algorithm [3] to efficiently route messages if there are no radio holes.  ... 
arXiv:1710.09280v2 fatcat:aflvsdbienfspmboqawsjd7t3u

Multi-Hop Video Routing Methods: State of the Art

Vaibhav Mishra, Kavita Choudhary, Saurabh Maheshwari
2014 International Journal of Computer Applications  
Therefore to remove all these issues, a new hierarchical routing algorithm for efficient video transmission is used.  ...  Some of the traditional encryption algorithms like RSA and DES are present but complexity of the computation and larger size of data makes this algorithm inefficient for encrypting video data.  ... 
doi:10.5120/16932-6921 fatcat:pde7yjqbgjfsva3te5gne7oi4y

Scheduling-Aware Routing for Supercomputers

Jens Domke, Torsten Hoefler
2016 SC16: International Conference for High Performance Computing, Networking, Storage and Analysis  
Unfortunately, today's routing algorithms do not utilize this important resource most efficiently.  ...  The interconnection network has a large influence on total cost, application performance, energy consumption, and overall system efficiency of a supercomputer.  ...  Nagel and his team for providing the batch job history of the Taurus HPC system installed at TU Dresden and for the opportunity to modify Taurus' routing algorithm over a longer period of time.  ... 
doi:10.1109/sc.2016.12 dblp:conf/sc/DomkeH16 fatcat:fq3smia6yjh3lelvzz2riocdk4

Fuzzy Cost Enabled Cluster Based Multipath Routing Algorithm for Mobile Ad-Hoc Networks

A.
2012 Journal of Computer Science  
Future work will be evaluated by implementing the algorithm related to other parallel architectures.  ...  Approach: By implementing FCECR, we have made changes to reduce the cost and route discovery overhead for the selection of best path from multipath routing from source to destination node.  ...  The various routing metrics used are: bandwidth, computing efficiency, power consumption, traffic load and the number of hops and cost vector.  ... 
doi:10.3844/jcssp.2012.1434.1440 fatcat:2jnwumvgmrg53hdtcidpkeua34

Multinode broadcasting in a wormhole-routed 2-D torus using an aggregation-then-distribution strategy

Y.-S. Chen, C.-Y. Chen
2000 IEE Proceedings - Computers and digital Techniques  
These subnetworks, which are responsible for distributing the messages, can well exploit the communication parallelism and the characteristic of wormhole routing.  ...  This paper presents an efficient multi-node broadcasting algorithm in a wormhole-routed 2-D torus, where there are an unknown number of s source nodes located on unknown positions each intending to broadcast  ...  Saad and Schultz [6] [7] initially defined this problem and proposed a simple routing algorithm for hypercubes.  ... 
doi:10.1049/ip-cdt:20000887 fatcat:ktisfnwkqbgalb5i74olcncsh4

The Development of Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks [chapter]

Mohamed Othman, Tg Dian Shahida Raja Mohd Auzar
2010 Trends in Telecommunications Technologies  
The chapter covers the development of crosstalk-free scheduling algorithms for routing in an OMIN.  ...  The book also contains chapters that deal with transport issues, and namely protocols and policies for efficient and guaranteed transmission characteristics while transferring demanding data applications  ...  The Development of Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks 661  ... 
doi:10.5772/8479 fatcat:cb353tzlprbtvhqxqrcunfkxzu

A Novel Energy Aware Routing Approach using ANN Technique with Data Fusion in WSN: Review

Pooja Singh, Vikas Pareek, Anil K.
2016 International Journal of Computer Applications  
In WSN can be deployed a fusion point for accurate decision. This study includes directing the efficient use of artificial intelligent protocol with data fusion concept.  ...  In wireless communication devices, due to resource constraints sensors evidence and delivery of reliable data is a difficult task.  ...  Classical routing protocols for WSNs and computational intelligence based routing protocol approach have fined tuned to make the data packets routing efficient and reliable.  ... 
doi:10.5120/ijca2016910376 fatcat:pbkbvc5ixbfjloxmz2jucln5pu

Path-Diverse In-Order Routing

Mieszko Lis, Myong Hyon Cho, Keun Sup Shim, Srinivas Devadas
2010 The 2010 International Conference on Green Circuits and Systems  
We present Path-Diverse In-Order Routing (PDIOR), an oblivious routing method which guarantees network-level inorder delivery for multi-path routing.  ...  As with EDVCA, PDIOR avoids the overheads inherent in reordering packets at the destination core, and requires only minor, inexpensive changes to traditional oblivious router architectures: for example  ...  Although some routing algorithms naturally deliver packets in order, they offer limited efficiency.  ... 
doi:10.1109/icgcs.2010.5543048 fatcat:hexjpgdmgng5fb7i2kxc74yiei

An asynchronous parallel metaheuristic for the period vehicle routing problem

Lúcia M.A. Drummond, Luiz S. Ochi, Dalessandro S. Vianna
2001 Future generations computer systems  
This paper presents an asynchronous parallel metaheuristic for the period vehicle routing problem (PVRP).  ...  The algorithm proposed is based on concepts used in parallel genetic algorithms and local search heuristics.  ...  Computational results Our experiments were run on a cluster of workstations with 4 RISC/6000 processors using the programming language C and MPI (message-passing interface) for parallelism [12] .  ... 
doi:10.1016/s0167-739x(99)00118-1 fatcat:wumg2a7g25fn3mwyubu5vajffa

Towards Real-Time Routing Optimization with Deep Reinforcement Learning: Open Challenges [article]

Paul Almasan, José Suárez-Varela, Bo Wu, Shihan Xiao, Pere Barlet-Ros, Albert Cabellos-Aparicio
2021 arXiv   pre-print
Consequently, DRL represents a promising technique to efficiently solve a variety of relevant network optimization problems, such as online routing.  ...  In this paper, we explore the use of state-of-the-art DRL technologies for real-time routing optimization and outline some relevant open challenges to achieve production-ready DRL-based solutions.  ...  With this representation, a message passing algorithm runs between the graph elements (i.e., the links of the network topology) according to the topology structure, and updates the link states [22] .  ... 
arXiv:2106.09754v1 fatcat:kbo23aqbabfrff5tm2cfnkv2ay

An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

Leilei Wang, Zhigang Chen, Jia Wu
2017 Information  
This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA).  ...  Vehicular ad hoc networks (VANETs) have emerged as a new powerful technology for data transmission between vehicles.  ...  There are countless strategies for updating the Ec table information. We state that the message will be updated after the message is passed.  ... 
doi:10.3390/info8040140 fatcat:s2nwuvzxrnfzvaosiwxxqsxzmu

Fundamental Lifetime Mechanisms in Routing Protocols for Wireless Sensor Networks: A Survey and Open Issues

Mohammadreza Eslaminejad, Shukor Abd Razak
2012 Sensors  
Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed.  ...  These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol  ...  Acknowledgements Mohammadreza Eslaminejad would like to thank Universiti Teknologi Malaysia (UTM) for awarding International Doctoral Fellowship (IDF).  ... 
doi:10.3390/s121013508 pmid:23202008 pmcid:PMC3545579 fatcat:3ma757euezg2hj2fimkwoq4f4u
« Previous Showing results 1 — 15 out of 9,858 results