Filters








178 Hits in 8.2 sec

Expanding across time to deliver bandwidth efficiency and low latency [article]

William M. Mellette, Rajdeep Das, Yibo Guo, Rob McGuinness, Alex C. Snoeren, George Porter
2019 arXiv   pre-print
The key to Opera's design is the rapid and deterministic reconfiguration of the network, piece-by-piece, such that at any moment in time the network implements an expander graph, yet, integrated across  ...  time, the network provides bandwidth-efficient single-hop paths between all racks.  ...  Consider an all-to-all shuffle operation, where a large number of hosts simultaneously need to exchange a small amount of data with one another.  ... 
arXiv:1903.12307v1 fatcat:mt4n25vdn5huxfykqoqvslakau

SODA

Yuan Lin, Hyunseok Lee, Mark Woh, Yoav Harel, Scott Mahlke, Trevor Mudge, Chaitali Chakrabarti, Krisztian Flautner
2006 SIGARCH Computer Architecture News  
Results show that a four processor design is capable of meeting the throughput requirements of the W-CDMA and 802.11a protocols, while operating within the strict power constraints of a mobile terminal  ...  A programmable hardware platform capable of supporting software implementations of the physical layer, or software defined radio, has a number of advantages.  ...  SSN is consisted of a shuffle exchange (SE) network (shown in Figure 6a ), an inverse shuffle exchange (ISE) network (shown in Figure 6b) , and a feedback path.  ... 
doi:10.1145/1150019.1136494 fatcat:eual6romzfd7neirdqmkne5tai

Asynchronous Transfer Mode (ATM) [chapter]

Thomas Robertazzi
2011 Basics of Computer Networking  
ATM is a 1 connection-oriented technology, in which a connection is established between the two endpoints before the actual data exchange begins.  ...  ATM provides a highly complex technology, with features intended for applications ranging from global telco networks to private local area computer networks.  ...  shuffle permutation) and baseline networks.  ... 
doi:10.1007/978-1-4614-2104-7_5 fatcat:uerogabc4rbrrcqzsmt5isz3o4

System area network mapping

Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel S. Wilkerson
1997 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97  
Respecting well-defined parameters, the algorithm produces a graph isomorphic to where is the network of switches and hosts and £ is the set of switches connected by a switch-bridge to the set of hosts  ...  Switched, multi-gigabyte per second, system area networks are the enabling building-blocks for networks of workstations.  ...  Acknowledgments The authors thank Bob Felderman at Myricom for his explanations and discussions of the Myrinet Algorithm as well as details pertaining to switch hardware and routing.  ... 
doi:10.1145/258492.258504 dblp:conf/spaa/ChunMSW97 fatcat:5uonv6aya5hvrfnjumniv72ijm

Routing in multihop packet switching networks: Gb/s challenge

C. Baransel, W. Dobosiewicz, P. Gburzynski
1995 IEEE Network  
Perhaps the cost of using fixed routing tables describing exactly the network topology will be paid off by the real simplicity of the routing rules and the flexibility of the network structure.  ...  Using these solutions as examples, they identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of high-speed networks and protocols  ...  Figures 1-3 depict three shuffle-like networks with p = 2. Shuffle-like networks based on de Bruijn graphs are defined when N is a power of the connectivity degree p.  ... 
doi:10.1109/65.386051 fatcat:jsvnv75u5rh4xnect2mdmh3xly

The Structure of Parallel Algorithms [chapter]

H.T. Kung
1980 Advances in Computers  
By presenting these algorithms in a single place, issues and techniques in designing algorithms for various types of parallel architectures are discussed and compared.  ...  The purpose of this article is to create a general framework for the study of parallel algorithms.  ...  Algorithms Using Shuffle-Exchange Networks Consider a network having n=2r' nodes, where m is an integer.  ... 
doi:10.1016/s0065-2458(08)60033-9 fatcat:xg4oc7d2bzftrl3ukzfebjmvfi

LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs [article]

Amer AlGhadhban, Abdulkadir Celik, Basem Shihada, Mohamed-Slim Alouini
2019 arXiv   pre-print
The proposed FD scheme has the flexibility of being implemented as in-network or centralized to classify flows of modifiable and unmodifiable hosts, respectively.  ...  Therefore, a fast-lightweight-and-accurate flow detection framework is developed by leveraging the transmission control protocol (TCP) behaviors.  ...  ) policy is designed to handle the two main flow classes (i.e., MFs and EFs) by separately routing them over disjoint virtual topologies.  ... 
arXiv:1912.05481v1 fatcat:hwzxeqqjnvc7pgkqwya24ptlfe

LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs

Amer Al Ghadhban, Abdulkadir Celik, Basem Shihada, Mohamed-Slim Alouini
2019 IEEE Transactions on Network and Service Management  
The proposed FD scheme has the flexibility of being implemented as in-network or centralized to classify flows of modifiable and unmodifiable hosts, respectively.  ...  Therefore, a fast-lightweight-andaccurate flow detection framework is developed by leveraging the transmission control protocol (TCP) behaviors.  ...  ) policy is designed to handle the two main flow classes (i.e., MFs and EFs) by separately routing them over disjoint virtual topologies.  ... 
doi:10.1109/tnsm.2019.2959740 fatcat:ikczt4mhubh5xlkuhkwuhc2yj4

Channel Exchanging Networks for Multimodal and Multitask Dense Image Prediction [article]

Yikai Wang, Wenbing Huang, Fuchun Sun, Fengxiang He, Dacheng Tao
2021 arXiv   pre-print
Specifically, the channel exchanging process is self-guided by individual channel importance that is measured by the magnitude of Batch-Normalization (BN) scaling factor during training.  ...  In this paper, we propose Channel-Exchanging-Network (CEN) which is self-adaptive, parameter-free, and more importantly, applicable for both multimodal fusion and multitask learning.  ...  These scaling factors further guide the then each time of channel exchanging by Eq. 4 (assumed channel exchanging process that exchanges a portion of no crossmodal  ... 
arXiv:2112.02252v1 fatcat:ul4gs5dajjc5lecol6psabn4pu

Neural network design of a banyan network controller

T.X. Brown, K.-H. Liu
1990 IEEE Journal on Selected Areas in Communications  
All my experiences at Caltech are intimately intertwined with her. iv Abstract A neural network is a highly interconnected set of simple processors.  ...  The many connections allow information to travel rapidly through the network, and due to their simplicity, many processors in one network are feasible.  ...  Although the non-blocking switches outperform the Banyan network, this better performance should be viewed in light of the extra complexity of a non-blocking switch.  ... 
doi:10.1109/49.62821 fatcat:nszkk6o2sje7rparwgi4oqmj3y

OblivP2P: An Oblivious Peer-to-Peer Content Sharing System

Yaoqi Jia, Tarik Moataz, Shruti Tople, Prateek Saxena
2016 USENIX Security Symposium  
First, we show that our construction retains the (linear) scalability of the original P2P network w.r.t the number of peers.  ...  A major security concern with content-sharing P2P systems is the risk of long-term traffic analysis -a widely accepted challenge with few known solutions.  ...  A note of thanks to the DeterLab team [64] for enabling access to the infrastructure.  ... 
dblp:conf/uss/JiaMTS16 fatcat:ky4k64icjrfetg6t7p4fai6gta

Optical tree topologies: Access control and wavelength assignment

Mario Gerla, Milan Kovačević, Joseph Bannister
1994 Computer networks and ISDN systems  
Finally, we present MONET, a Multilevel Optical Network architecture which can be efficiently implemented on a tree topology.  ...  Then, we discuss the access schemes which can be implemented on a tree.  ...  This intuition is confirmed by quantitative results based on the comparison of a variety of topologies for a vast sample of node locations [3] .  ... 
doi:10.1016/0169-7552(94)90056-6 fatcat:qqyhtpcfmzgzxmide3eforof44

Session reports for SIGCOMM 2010

Shailesh Agrawal, Immanuel Ilavarasan Thomas, Arun Vishwanath, Tianyin Xu, Fang Yu, Kavitha Athota, Pramod Bhatotia, Piyush Goyal, Phani Krisha, Kirtika Ruchandan, Nishanth Sastry, Gurmeet Singh (+1 others)
2011 Computer communication review  
Bridging was never intended to do that: it was kind of a hack because people at the time were all confused about what Layer 3 was and they thought Ethernet was a competitor to DECnet.  ...  The paths they find, to our elation, Are least cost paths to destination! With packet hop counts we now see, The network need not be loop-free! About computing trees deterministically.  ...  Hierarchical design, 2. Secure congestion policing in the network, 3.  ... 
doi:10.1145/1925861.1925873 fatcat:jpaoo55h75hprb5k2vlkin5zzi

Why High-Performance Modelling and Simulation for Big Data Applications Matters [chapter]

Clemens Grelck, Ewa Niewiadomska-Szynkiewicz, Marco Aldinucci, Andrea Bracciali, Elisabeth Larsson
2019 Msphere  
One of the tangible outcomes of the COST Action is a collection of case studies from various computing domains.  ...  Each case study brought together both HPC and M&S experts, giving witness of the effective cross-pollination facilitated by the COST Action.  ...  This work was supported by the ICT COST Action IC1406 High-Performance Modelling and Simulation for Big Data Applications.  ... 
doi:10.1007/978-3-030-16272-6_1 fatcat:3zyj3266mzhffeic5rlqqe7mx4

In-Memory Big Data Management and Processing: A Survey

Hao Zhang, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, Meihui Zhang
2015 IEEE Transactions on Knowledge and Data Engineering  
We are witnessing a revolution in the design of database systems that exploits main memory as its data storage layer.  ...  In this survey, we aim to provide a thorough review of a wide range of in-memory data management and processing proposals and systems, including both data storage systems and data processing frameworks  ...  ACKNOWLEDGMENTS This work was supported by A*STAR project 1321202073.  ... 
doi:10.1109/tkde.2015.2427795 fatcat:u7r3rtvhxbainfeazfduxcdwrm
« Previous Showing results 1 — 15 out of 178 results