Filters








287,159 Hits in 3.0 sec

On Optimal Merging Networks [chapter]

Kazuyuki Amano, Akira Maruoka
2003 Lecture Notes in Computer Science  
Ñ ¿ Ò ÓÖ Ò ¼ ½ ¿ ÑÓ º ÍÒ ÓÖØÙÒ Ø Ðݸ ÓÖ Ò ¾ ÑÓ ¸Ø ×Ø ÐÓÛ Ö ÓÙÒ × Ó Ø Ò Ý Õº´½µ × Å´Ñ Òµ ´Ñ Òµ ½ ÓÖ Ñ ¿ º ËÓÑ Û Ø ÒØ Ö ×Ø Ò ÐÝ¸Ø × Ò ¾ ÑÓ × Ñ× Ö ×Ø ØÓ Ø ÖÑ Ò Ø Ü Ø Ú ÐÙ × Ó Å´Ñ Òµ ÓÖ Ñ ¿ º Ì Ü Ø Ú ÐÙ ×  ...  ¾µ´ Ò Ë Ø ÓÒ ¿µ¸ Ò Å´ · ¾µ ´ · ¾µ´ Ò Ë Ø ÓÒ µº Ì ÖÙ Ð Ô ÖØ Ó Ø ÔÖÓÓ × Ó Ø ÓÚ Ö ×ÙÐØ× × Ö Ø Ö Þ Ò Ø ×ØÖÙØÙÖ Ó ÓÔØ Ñ Ð´¾ Òµ¹Ñ Ö Ò Ò ØÛÓÖ ×´Ì ÓÖ Ñ ½µ¸Û Û ×Ö Ò Ë Ø ÓÒ ¾º ÁÒ Ø ÓÒ¸ÓÙÖ Ö ÙÑ ÒØ× Ò Ð×Ó Ù× ØÓ Ø ÖÑ  ... 
doi:10.1007/978-3-540-45138-9_9 fatcat:uu7w4s3nsncovpzs7nijbu24ia

Hardware Implementation of a Low-Power K-Best MIMO Detector Based on a Hybrid Merge Network

Ibrahim A. Bello, Basel Halak, Mohammoed El-Hajjar, Mark Zwolinski
2018 2018 28th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS)  
Furthermore, the sorter incorporates different merge algorithms at selected stages in order to reduce the total comparator count.  ...  In this paper, we present the hardware implementation of a K-best detector based on a single-stage architecture, targeted at low-rate and lowpower applications.  ...  The combinational delay of the merge network can be reduced by inserting one or more pipeline registers at suitable locations, thereby splitting the merge network into two or more smaller merge networks  ... 
doi:10.1109/patmos.2018.8464169 dblp:conf/patmos/BelloHEZ18 fatcat:d2jaunb7hzagxi3pick67yw4ea

On Optimal Piggyback Merging Policies for Video-On-Demand Systems Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific pe ... [chapter]

Charu Aggarwal, Joel Wolf, Philip S. Yu
2002 Readings in Multimedia Computing and Networking  
In this paper we concentrate on one such technique, known as adaptive piggybacking. We develop and analyze piggyback merging policies which are optimal over large classes of reasonable methods.  ...  A critical issue in the performance of a video-on-demand system is the 1/0 bandwidth required in order to satisfy client requests.  ...  The optimal window size W* is also shown, and matches the best performance of the generalized simple merging policy.  ... 
doi:10.1016/b978-155860651-7/50149-2 fatcat:qfhsd5ryinfadhozogsyjnpkya

Asymptotically optimal randomized tree embedding in static networks

K. Li
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
It is shown that these algorithms, which have a small constant dilation, are asymptotically optimal. Our analysis technique is based on random walks on static networks.  ...  In particular, we propose simple randomized algorithms on several most common and important static networks, including d-dimensional meshes, ddimensional tori, and hypercubes.  ...  It is shown that these algorithms, which have a small constant dilation, are asymptotically optimal. Our analysis technique is based on random walks on static networks.  ... 
doi:10.1109/ipps.1998.669951 dblp:conf/ipps/Li98 fatcat:uhjgv6sc2vae5peem7k6f47yye

Hyper-butterfly network: a scalable optimally fault tolerant architecture

W. Shi, P.K. Srimani
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
But, hyper-deBruijn networks are not regular, are not optimally fault tolerant and the optimal routing is relatively complex.  ...  On the other hand, networks like hypercube (where degree of a node grows with the size of a network) can provide the desired fault tolerance but the design of a node becomes problematic for large networks  ...  Remark 10 The constructive proof for the theorem on vertex connectivity (Theorem 5) readily suggests an optimal routing scheme in the network in the presence of maximal number of allowable faults (such  ... 
doi:10.1109/ipps.1998.670008 dblp:conf/ipps/ShiS98 fatcat:kgy3cmn25rbifffj7sivmy5fhu

Minimizing total communication distance of a time-step optimal broadcast in mesh networks

Songluan Cang, Jie Wu
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
In this paper, we propose a new minimum total communication distance (T C D ) algorithm and an optimal T C D algorithm for broadcast in a 2-dimension mesh.  ...  The mesh-connected topology is one of the most thoroughly investigated network topologies.  ...  Obviously, the overall network traffic contention, as well as the communication delay, depends on the T C D .  ... 
doi:10.1109/ipps.1998.669882 dblp:conf/ipps/CangW98 fatcat:w2uznpbwxjhq3hyy4vlomcjbu4

Optimally locating a structured facility of a specified length in a weighted tree network

Shan-Chyun Ku, Biing-Feng Wang
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a weighted tree network a tree-shaped facility of a specified length.  ...  Recently, in [6, 7] , Peng and Lo have proposed efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path and a tree of a specified length.  ...  Wang, "Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network," manuscript.  ... 
doi:10.1109/ipps.1998.669942 dblp:conf/ipps/KuW98 fatcat:w4mx553xvnhobdxt5aig6jbna4

Optimal contention-free unicast-based multicasting in switch-based networks of workstations

R. Libeskind-Hadas, D. Mazzoni, R. Rajagopalan
Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing  
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations.  ...  The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention.  ...  These networks comprise a collection of routing switches and workstations interconnected in some arbitrary topology. Currently, switches support only unicast one-to-one communication in hardware.  ... 
doi:10.1109/ipps.1998.669940 dblp:conf/ipps/Libeskind-HadasMR98a fatcat:ts6i6mbzpbgyxlr2ibdac6qmde

Strategies of Merging Compressors for Capital Cost Reduction in Hydrogen Networks Synthesis

Xiaoqiang Liang, Yongzhong Liu
2017 Process Integration and Optimization for Sustainability  
the mixing inlet streams and the unknown pressures of compressors, which greatly reduced the complexity in solving the hydrogen network optimization models.  ...  To solve this problem, a method of compressor merging is proposed in this work, in which two strategies of merging compressors are proposed, namely, the hydrogen sources oriented compressors merging strategy  ...  Compliance with Ethical Standards Conflict of Interest On behalf of all authors, the corresponding author states that there is no conflict of interest.  ... 
doi:10.1007/s41660-017-0017-y fatcat:g6rd67jbdrd4naerqj6b54cvru

Detecting hierarchical and overlapping network communities using locally optimal modularity changes

Michael J. Barber
2013 European Physical Journal B : Condensed Matter Physics  
We describe a hierarchical clustering algorithm based on a local optimality property. For each edge in the network, we associate the modularity change for merging the communities it links.  ...  Communities are successively merged into larger communities, coarsening a network of actors into a more manageable network of communities.  ...  But to exclude merging v and w, we must then only make one of the locally optimal merges. In this work, we adopt the latter approach, arbitrarily selecting one of the locally optimal merges.  ... 
doi:10.1140/epjb/e2013-40645-6 fatcat:6w2offuz7beydiz4oaqtcmahqi

A New Binomial Mapping and Optimization Algorithm for Reduced-Complexity Mesh-Based On-Chip Network

Wein-Tsung Shen, Chih-Hao Chao, Yu-Kuang Lien, An-Yeu Wu
2007 First International Symposium on Networks-on-Chip (NOCS'07)  
This paper presents an efficient binomial IP mapping and optimization algorithm (BMAP) to reduce the hardware cost of on-chip network (OCN) infrastructure. The complexity of BMAP is O(N 2 log(N)).  ...  The experimental result shows total traffic on network is reduced by 37% and average network hop count is reduced by 46%.  ...  The basic one comes from our binomial mapping algorithm. l Optimization: The optimized network architecture is the second stage output of the OCN design flow.  ... 
doi:10.1109/nocs.2007.5 dblp:conf/nocs/ShenCLW07 fatcat:hdrlzz2q5rhpvfd46n4fj4e3zq

A Configuration Algorithm for Provisioning of Cell-Based MPLS Network [chapter]

Daniel Won-Kyu Hong, Choong Seon Hong, Dong-Sik Yun
2003 Lecture Notes in Computer Science  
The backtracking algorithm is to determine the optimal multipoint-to-point route based on the order information allocated by ordering algorithm.  ...  This paper proposes a configuration algorithm of multipointto-point connection for facilitating VC merge concept in an MPLS over ATM network.  ...  Determination of Optimal VC-Merge Point With the ordering and backtracking algorithms, we can determine the optimal VC-merge point under the complex network topology.  ... 
doi:10.1007/3-540-44864-0_81 fatcat:d63yi3l5hzd7berivxib5ui6pa

Some minimum merging networks

Gembu Morohashi, Shigeki Iwata
2004 Theoretical Computer Science  
We extend Iwata's proofs and show that Batcher's (6, 8k + 7)-, (9, 16k + 9)-, (7, 8)-merging networks are optimal for all k 0.  ...  Under an assumption of existence of such min{m, n} comparators in optimal (m, n)-merging networks, we show that M(n, n) = M(n − 1, n) + 1 = M(n − 2, n) + 3.  ...  The first two lemmas are on basic properties of merging networks, and the last one is on the number of comparators connecting two consecutive lines at the top of optimal merging networks.  ... 
doi:10.1016/j.tcs.2004.09.003 fatcat:zbag4bkrundctecjy7ddtjtcpu

Optimized network clustering by jumping sub-optimal dendrograms [article]

Nicolas Bock and Erik Holmström and Johan Brännlund
2009 arXiv   pre-print
We propose a method to improve community division techniques in networks that are based on agglomeration by introducing dendrogram jumping.  ...  The method is based on iterations of sub-optimal dendrograms instead of optimization of each agglomeration step.  ...  Motivated by our previous work on the modularity density of networks [20] we avoid the problem by performing incomplete optimizations in each merge process.  ... 
arXiv:0711.1603v2 fatcat:5gcgeu3td5ahtb7xp3s6xmh5ie

Agile Traffic Merging for DCNs [chapter]

Qing Yi, Suresh Singh
2015 Lecture Notes in Computer Science  
In this paper, we examine the power optimization model for DCNs, and present a scalable heuristic algorithm that finds a near-optimal subset of network switches and links that satisfies a given traffic  ...  Furthermore, we apply merge networks to each switch in order to power off the idle interfaces of the active switches, thus further reducing the energy consumption of active switches and achieving greater  ...  Fig. 2 shows a k 2 × k 2 merge network connected to k/2 servers on one side and to the k/2 ports of an edge switch on the other side. 1.  ... 
doi:10.1007/978-3-319-15786-3_1 fatcat:csr2ba4wzba5rdz3iqyeun23l4
« Previous Showing results 1 — 15 out of 287,159 results