Filters








2,975 Hits in 3.9 sec

Faster Transit Routing by Hyper Partitioning

Daniel Delling, Julian Dibbelt, Thomas Pajor, Tobias Zündorf, Marc Herbstritt
2017 Algorithmic Approaches for Transportation Modeling, Optimization, and Systems  
Our key idea is to first partition a hypergraph into cells, in which vertices correspond to routes (e.g., bus lines) and hyperedges to stops, and to then mark routes sufficient for optimal travel across  ...  This results in a practical approach, suitable for networks that are too large to be efficiently handled by the basic RAPTOR algorithm.  ...  AT M O S 2 0 1 7 8:6 Faster Transit Routing by Hyper Partitioning However, this may be too time consuming in practice.  ... 
doi:10.4230/oasics.atmos.2017.8 dblp:conf/atmos/DellingDPZ17 fatcat:rrkorebn4rdcvlcwcxf4m42rc4

Hyper-BCube: A scalable data center network

Dong Lin, Yang Liu, Mounir Hamdi, Jogesh Muppala
2012 2012 IEEE International Conference on Communications (ICC)  
We then propose fault-tolerant and routing mechanisms for Hyper-BCube.  ...  In this paper, we propose a cost-effective and gracefully scalable data center interconnect termed Hyper-BCube that combines the advantages of both DCell and BCube architectures while avoiding their limitations  ...  This research has been supported by a grant from Huawei Technologies Co. LTD. (Project code: HUAW10B15Z002.09/10PN).  ... 
doi:10.1109/icc.2012.6363759 dblp:conf/icc/LinLHM12 fatcat:fpc2x7dvq5hdfjwegwzcalewmy

Hyper Threading Technology in Hardware Architecture for Processor Efficiency Enhancement

Neha Srivastava, Kalyan Awasthi, And Sadaf Z. Rizvi
2015 SAMRIDDHI A Journal of Physical Sciences Engineering and Technology  
Intel's Hyper-Threading Technology brings the concept of simultaneous multi-threading to the Intel architecture.  ...  This paper describes the Hyper-Threading Technology architecture of Intel's first implementation on the Intel Xeon processor family.  ...  The other route to higher performance is to accomplish more work on each clock cycle, and that's where Hyper-Threading Technology comes in.  ... 
doi:10.18090/samriddhi.v3i1.1611 fatcat:34bvho3tw5fdxmfzfowtwgcqcm

Low-Power Architectural Synthesis and the Impact of Exploiting Locality [chapter]

Renu Mehra, Lisa M. Guerra, Jan M. Rabaey
1996 Technologies for Wireless Computing  
The technique uses algorithm partitioning to preserve locality in the assignment of operations to hardware units.  ...  Mehra is supported by the ARPA grant J-FBI 93-153 and Ms. Guerra is supported by scholarships from AT&T and the Office of Naval Research. Their support is gratefully acknowledged. References  ...  in 34 transitions.  ... 
doi:10.1007/978-1-4613-1453-0_10 fatcat:4av7tty7nbamxksntidngi7c24

Low-power architectural synthesis and the impact of exploiting locality

Renu Mehra, Lisa M. Guerra, Jan M. Rabaey
1996 Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology  
The technique uses algorithm partitioning to preserve locality in the assignment of operations to hardware units.  ...  Mehra is supported by the ARPA grant J-FBI 93-153 and Ms. Guerra is supported by scholarships from AT&T and the Office of Naval Research. Their support is gratefully acknowledged. References  ...  in 34 transitions.  ... 
doi:10.1007/bf01130408 fatcat:xg2efo43vvflflfcaswl7bniee

Parallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing Units

Subbaraj
2012 Journal of Computer Science  
The correctness of the GPU based MA has been verified by comparing its result with a CPU based MA.  ...  Conclusion: Its indicates that our approach is on average 5×faster when compared to a CPU based implementation. With the Tesla C1060 GPU server, our approach would be potentially 10×faster.  ...  Cutsize: The set of hyper edges cut by a cluster C is given by E(C) = {e Є E: 0 < |e ∩ C| < |e|} i.e., e Є E(C) if at least one, but not all, of the pins of e are in C.  ... 
doi:10.3844/jcssp.2012.705.710 fatcat:hhxxbosirzbq3hurchx2hee4w4

On Static and Dynamic Partitioning Behavior of Large-Scale P2P Networks

D. Leonard, Z. Yao, X. Wang, D. Loguinov
2008 IEEE/ACM Transactions on Networking  
This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, under both types of node failure.  ...  We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1 (1)) remain connected under random  ...  Then, for each non-absorbing state , its transition rate to is given by: where is the cell of matrix corresponding to transitions from state to .  ... 
doi:10.1109/tnet.2007.911433 fatcat:y7oqacx6w5ao5ocl7zmmrm4a24

Data-Driven Optimization of Public Transit Schedule [article]

Sanchita Basak, Fangzhou Sun, Saptarshi Sengupta, Abhishek Dubey
2019 arXiv   pre-print
Bus transit systems are the backbone of public transportation in the United States.  ...  GA) as well as a particle swarm optimization (PSO) algorithm are employed to solve it, (c) a detailed discussion on empirical results comparing the algorithms are provided and sensitivity analysis on hyper-parameters  ...  We acknowledge the support provided by our partners from Nashville Metropolitan Transport Authority.  ... 
arXiv:1912.02574v1 fatcat:g2klvsd3h5gqljlybswdkfl6ry

HYPER-LP: A System for Power Minimization Using Architectural Transformations [chapter]

Anantha P. Chandrakasan, Miodrag Potkonjak, Jan Rabaey, Robert W. Brodersen
2003 The Best of ICCAD  
Examples with varying degree of computational complexity and structures are optimized and synthesized using the HYPER-LP system.  ...  An automated high-level synthesis system, HYPER-LP, is presented for minimiring power consumption in application specific datapath intensive CMOS circuits using a variety of architectural and computational  ...  Acknowledgments This project was funded by DARPA. We would like to thank S han-Hsi Huang for coding and supporting the library of local transformation primitives.  ... 
doi:10.1007/978-1-4615-0292-0_10 fatcat:av42atse7reo5o33ivm23tfjc4

Hardware architecture design for explicit model predictive control

T.A. Johansen, W. Jackson, R. Schreiber, P. Tondel
2006 2006 American Control Conference  
It has recently been shown that such evaluation can be boosted by binary search tree data structures.  ...  This facilitates implementation of constrained MPC in small-scale industrial and consumer electronics applications that are characterized by fast sampling or low cost, such as mechatronics, MEMS, rotating  ...  ACKNOWLEDGEMENTS This work was in part funded by the Research Council of Norway.  ... 
doi:10.1109/acc.2006.1656501 fatcat:cn2pmnxfxvcclbnms6yy2rd75e

Skew Bounded Buffer Tree Resynthesis For Clock Power Optimization

Subhendu Roy, David Z. Pan, Pavlos M. Mattheakis, Peter S. Colyer, Laurent Masse-Navette, Pierre-Olivier Ribet
2015 Proceedings of the 25th edition on Great Lakes Symposium on VLSI - GLSVLSI '15  
Experimental results on industrial designs, with clock networks synthesized and routed by an industrial tool, have demonstrated that our approach can achieve an average reduction of 5.6% and 3.5% in clock  ...  Clock networks are typically synthesized and routed to optimize for zero clock skew.  ...  A hyper-net is a set of logically equivalent or opposite polarity nets which are separated by buffers or inverters in the same physical partition as the root driver of the top net [21] .  ... 
doi:10.1145/2742060.2742119 dblp:conf/glvlsi/RoyPMCMR15 fatcat:rs5gsx4k65eghpj5rd22bgv3va

Transit Node Routing Reconsidered [chapter]

Julian Arz, Dennis Luxen, Peter Sanders
2013 Lecture Notes in Computer Science  
Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR.  ...  Finally, we show that a specialization to the online many-to-one (or one-to-many) shortest path further speeds up query time by an order of magnitude.  ...  Transit Node Routing TNR in itself is not a complete algorithm, but a framework.  ... 
doi:10.1007/978-3-642-38527-8_7 fatcat:nyx2ixvvibhwnc36mus7bp4zmq

Transit Node Routing Reconsidered [article]

Julian Arz, Dennis Luxen, Peter Sanders
2013 arXiv   pre-print
Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR.  ...  Finally, we show that a specialization to the online many-to-one (or one-to-many) shortest path further speeds up query time by an order of magnitude.  ...  Transit Node Routing TNR in itself is not a complete algorithm, but a framework.  ... 
arXiv:1302.5611v1 fatcat:dy4fxi2cwfcl7p3pkrvixhnqnq

Optimizing power using transformations

A.P. Chandrakasan, M. Potkonjak, R. Mehra, J. Rabaey, R.W. Brodersen
1995 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Examples with varying degree of computational complexity and structures are optimized and synthesized using the HYPER-LP system.  ...  A high-level synthesis system, HYPER-LP, is presented for minimizing power consumption in application specific datapath intensive CMOS circuits using a variety of architectural and computational transformations  ...  Acknowledgments This project was funded by ARPA.  ... 
doi:10.1109/43.363126 fatcat:cyy6t2ikyjdglfoo7natevd7ly

Buffer management in wormhole-routed torus multicomputer networks

Kamala Kotapati, Sivarama P. Dandamudi
2000 Future generations computer systems  
The non-star channels will be used when taking any of the transitions that aould not be allowed by the e-cube routing algori t hm, t hus obtaining full adapt ivi ty while presening freedom from deadlock  ...  The SAF version The netaork is partitioned such that there are no cycles in any partition. and each partition is given a unique number.  ... 
doi:10.1016/s0167-739x(99)00128-4 fatcat:6emrnixhcjhrvfhzskliadp5vm
« Previous Showing results 1 — 15 out of 2,975 results