Filters








3,587 Hits in 6.8 sec

Product Form Queueing Networks [chapter]

Simonetta Balsamo
2000 Lecture Notes in Computer Science  
Various special models of product form queueing networks allow to represent particular system features such as state-dependent routing, negative customers, batch arrivals and departures and finite capacity  ...  Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorithms to evaluate average performance measures.  ...  Another research issue is the integration and/or the relation between queueing networks and other classes of models with different characteristics, such as for example stochastic Petri nets or stochastic  ... 
doi:10.1007/3-540-46506-5_16 fatcat:t2l6atnzfzaldhlli4reywccqi

Page 7145 of Mathematical Reviews Vol. , Issue 89M [page]

1989 Mathematical Reviews  
The analysis yields (1) the steady-state queue length distribution, and for each input parcel, (2) the steady-state queue length distribution at arrivals, (3) the probability that an arriving call is blocked  ...  Summary: “The problem of structural synthesis of a class of com- munication networks in which information is transmitted at each time instant only between the nodes of a single pair is examined.” 89m:90066  ... 

A systematic eight port network on chip router with reduced critical section problem

T. Saipriyadharshini, R. Parameshwaran
2014 Contemporary Engineerng Sciences  
Network on chip is an emerging technology which provides data reliability and high speed with less power consumption.  ...  This flexibility comes at the cost of additional area and power dissipation. The proposed work consists of an eight port router with high speed which provide high throughput and with less latency.  ...  Two main operation of this FIFO block is as follows [3] : Write operation and Read operation This block designed with the capacity to handle particular number of bits.  ... 
doi:10.12988/ces.2014.4210 fatcat:it4yp2dbfrfm5nhxuk5rrtcz5a

Application-specific 3D Network-on-Chip design using simulated allocation

Pingqiang Zhou, Ping-Hung Yuh, Sachin S. Sapatnekar
2010 2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)  
We present an efficient floorplanaware 3D NoC synthesis algorithm, based on simulated allocation, a stochastic method for traffic flow routing, and accurate power and delay models for NoC components.  ...  We demonstrate that this method finds greatly improved topologies for various design objectives such as NoC power (average savings of 34%), network latency (average reduction of 35%) and chip temperature  ...  ACKNOWLEDGMENTS The authors would like to thank professor Yuan Xie in Pennsylvania State University for providing the 3D floorplanner.  ... 
doi:10.1109/aspdac.2010.5419830 dblp:conf/aspdac/ZhouYS10 fatcat:v7xgne7nrjhpvbayjn73gyczoq

A scalable packet-switch architecture based on OQ NoCs for data center networks

Fadoua Hassen, Lotfi Mhamdi
2017 Computer Networks  
We assess the performance of the switch in terms of throughput, end-to-end latency and blocking probability using Markov chain analysis, and we propose an analytical model that integrates the various design  ...  In particular, we describe a three-stage switch with Output-Queued Unidirectional NoCs (OQ-UDN) in the central stage of the Clos-network.  ...  The end-to-end blocking probability of a route r in the OQ-UDN fabric is bounded by the sum of the blocking probabilities of its output queues.  ... 
doi:10.1016/j.comnet.2017.08.003 fatcat:g7og33fjjfcy5dn6y3lng5dbwe

Providing performance guarantees in data center network switching fabrics

Fadoua Hassen, Lotfi Mhamdi
2016 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)  
We also provide an upper-bound estimation of the end-to-end blocking probability in the proposed switch to help predict performance and to optimize the design.  ...  This paper proposes a novel and highly scalable multistage packet-switch design based on Networks-on-Chip (NoC).  ...  We use the store-and-forward switching mode to transfer traffic across the NoC modules. Several routes exist between blocks of the different stages of the Clos-network.  ... 
doi:10.1109/hpsr.2016.7525660 dblp:conf/hpsr/HassenM16 fatcat:zddvrgxpwzdjjaf6d6mu7xmbxi

A framework for the design, synthesis and cycle-accurate simulation of multiprocessor networks

Raymond R. Hoare, Zhu Ding, Shenchih Tung, Rami Melhem, Alex K. Jones
2005 Journal of Parallel and Distributed Computing  
A non-blocking queue, with up to 128 internal queues, and a real-time bandwidth scheduler, for up to 128 ports, were designed in hardware with hardware synthesis results presented.  ...  This paper introduces a framework for the design, synthesis and cycle-accurate simulation for parallel computing networks of 128+ processors.  ...  A network's design is not only dependent on the topology and routing algorithms but is also dependent on the design of each of the different components.  ... 
doi:10.1016/j.jpdc.2005.04.022 fatcat:xmmvvyqq5nddrgacfkfr77mrwe

Admitting and ejecting flits in wormhole-switched networks on chip

Z. Lu, A. Jantsch
2007 IET Computers & Digital Techniques  
The proposed flit-admission and flit-ejection schemes are evaluated with both uniform and locality traffic in a 2D 4 4 mesh network.  ...  In particular, for flit admission, a novel coupling scheme which binds a flit-admission queue with a physical channel (PC) is presented.  ...  flitisation, maintaining states and routing, 'sink logic' for the access of sink FIFOs, maintaining states and assembly, 'crossbar' and 'credit logic' for updating and managing the status of downstream  ... 
doi:10.1049/iet-cdt:20050068 fatcat:eh2qkeoczrhk3g4tah56uivi2m

Page 5712 of Mathematical Reviews Vol. , Issue 95i [page]

1995 Mathematical Reviews  
The topology may be arbitrary, there are multiple traffic classes, and the routing can be class dependent, with routes that may form direct or indirect loops.  ...  This not only covers various known concavity results for tandems, cycles, and fork-join networks of stations with general blocking and starvation, but also establishes new ones for certain classes of networks  ... 

Multivariate Probabilistic Synthesis of Cellular Networks Teletraffic Blocking with Poissonian Distribution Arrival Rates

Vincent Omollo Nyangaresi, Silvance Abeka, Anthony Rodrigues
2018 International Journal of Wireless and Microwave Technologies  
Index Terms: Blocking probability, grade of service, quality of service, teletraffic. 15 Blocking with Poissonian Distribution Arrival Rates Vincent O.  ...  With the increasing number of users, these resources may become unavailable, leading to new call blocking or handover call blocking.  ...  SDCCH Based GSM Teletraffic Blocking Probabilistic Synthesis In GSM networks, the performance of the SDCCH depends on the actual call arrival rates and the equivalent call holding times.  ... 
doi:10.5815/ijwmt.2018.04.02 fatcat:gyfxc3ziyvbkpbz46ntr2lm55e

VHDL generation from SDL specifications [chapter]

Jean-Marc Daveau, Gilberto Fernandes Marchioro, Carlos Alberto Valderrama, Ahmed Amine Jerraya
1997 Hardware Description Languages and their Applications  
In addition our methodology should be compatible with others system de-  ...  The code produced should be acceptable by existing simulation and synthesis tools. 2. to have an efficient implementation of system level communication schemes. 3. to be able to choose between different  ...  ACKNOWLEDGEMENTS This work was supported by France-Telecom/CNET under grant 94 1B 113, ESPRIT programme under project COMITY 23015, SGS-Thomson and Aerospatiale.  ... 
doi:10.1007/978-0-387-35064-6_18 fatcat:vlasjwqrhrdxph5f3g5kfjmvna

VHDL generation from SDL specifications [chapter]

Jean-Marc Daveau, Gilberto Fernandes Marchioro, Carlos Alberto Valderrama, Ahmed Amine Jerraya
2002 Readings in Hardware/Software Co-Design  
In addition our methodology should be compatible with others system de-  ...  The code produced should be acceptable by existing simulation and synthesis tools. 2. to have an efficient implementation of system level communication schemes. 3. to be able to choose between different  ...  ACKNOWLEDGEMENTS This work was supported by France-Telecom/CNET under grant 94 1B 113, ESPRIT programme under project COMITY 23015, SGS-Thomson and Aerospatiale.  ... 
doi:10.1016/b978-155860702-6/50011-9 fatcat:x6eihwewfbf4piwqhv73ejmmz4

Multi-objective evacuation routing in transportation networks

Alexander Stepanov, James MacGregor Smith
2009 European Journal of Operational Research  
An integer programming (IP) formulation for optimal route assignment is presented, which utilizes M/G/c/c state dependent queueing models to cope with congestion and time delays on road links.  ...  In this paper, the optimal design and analysis of evacuation routes in transportation networks is examined. An methodology for optimal egress route assignment is suggested.  ...  (1996) 8 M/G/c/c state dependent queueing model Micro Static Analytical technique Jain and Smith (1997) 9 MGCCSimul Micro Dynamic Simulation with M/G/c/c state- dependent queues  ... 
doi:10.1016/j.ejor.2008.08.025 fatcat:wciguebbrvcf5is6aotitteule

Page 2932 of Mathematical Reviews Vol. , Issue 89E [page]

1989 Mathematical Reviews  
DQNs emerge from a synthesis of the well-known separable queueing networks (BCMP networks) and the classical machine-repair-man model.  ...  Two types of random routing are considered in this paper. Results obtained include state-transition probability, blocking probability, delay, and throughput.  ... 

Compositional Verification of a Switch Fabric from Nortel Networks [chapter]

Hong Peng, Sofiène Tahar, Yassine Mokhtari
2003 Lecture Notes in Computer Science  
We implemented the framework on top of the VIS tool and applied it on an ATM switch fabric from Nortel Networks.  ...  With the development of ASIC designs, simulation cannot cover all the corner cases in a complicated design.  ...  Namely, in the ingress part, valid cells (with good HEC and matching VPI/VCI) are switched into the queue, and in the egress part, cells in the queue are restructured and sent.  ... 
doi:10.1007/978-3-540-39893-6_32 fatcat:dmjib37tynfcxaxxipdler5sw4
« Previous Showing results 1 — 15 out of 3,587 results