486,282 research outputs found
An Empirical Comparison of Area-Universal and Other Parallel Computing Networks
This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being compared. The increasingly popular wormhole routing model is used throughout
A Seamless Vertical Handoff Protocol for Enhancing the Performance of Data Services in Integrated UMTS/WLAN Network
The Next Generation Wireless Network (NGWN) is speculated to be a unified network composed of several existing wireless access networks such as Wireless Local Area Network (WLAN), Global System for Mobile (GSM), Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), and satellite network etc
Efficient Interconnection Schemes for VLSI and Parallel Computation
This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson\u27s fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these universal networks can efficiently simulate competing networks by means of an appropriate correspondence between network components and efficient algorithms for routing messages on the universal network. In particular, a universal network of area A can simulate competing networks with O(lg^3A) slowdown (in bit-times), using a very simple randomized routing algorithm and simple network components. Alternatively, a packet routing scheme of Leighton, Maggs, and Rao can be used in conjunction with more sophisticated switching components to achieve O(lg^2 A) slowdown. Several other important aspects of universality are also discussed. It is shown that universal networks can be constructed in area linear in the number of processors, so that there is no need to restrict the density of processors in competing networks. Also results are presented for comparisons between networks of different size or with processors of different sizes (as determined by the amount of attached memory). Of particular interest is the fact that a universal network built from sufficiently small processors can simulate (with the slowdown already quoted) any competing network of comparable size regardless of the size of processors in the competing network. In addition, many of the results given do not require the usual assumption of unit wire delay. Finally, though most of the discussion is in the two-dimensional world, the results are shown to apply in three dimensions by way of a simple demonstration of general results on graph layout in three dimensions. The second main problem considered in this thesis is channel routing when many layers of interconnect are available, a scenario that is becoming more and more meaningful as chip fabrication technologies advance. This thesis describes a system MulCh for multilayer channel routing which extends the Chameleon system developed at U. C. Berkeley. Like Chameleon, MulCh divides a multilayer problem into essentially independent subproblems of at most three layers, but unlike Chameleon, MulCh considers the possibility of using partitions comprised of a single layer instead of only partitions of two or three layers. Experimental results show that MulCh often performs better than Chameleon in terms of channel width, total net length, and number of vias. In addition to a description of MulCh as implemented, this thesis provides improved algorithms for subtasks performed by MulCh, thereby indicating potential improvements in the speed and performance of multilayer channel routing. In particular, a linear time algorithm is given for determining the minimum width required for a single-layer channel routing problem, and an algorithm is given for maintaining the density of a collection of nets in logarithmic time per net insertion. The last part of this thesis shows that straightforward techniques for implementing finite-state machines are optimal in the worst case. Specifically, for any s and k, there is a deterministic finite-state machine with s states and k symbols such that any layout algorithm requires (ks lg s) area to lay out its realization. For nondeterministic machines, there is an analogous lower bound of (ks^2) area
Transmission Delay of Multi-hop Heterogeneous Networks for Medical Applications
Nowadays, with increase in ageing population, Health care market keeps
growing. There is a need for monitoring of Health issues. Body Area Network
consists of wireless sensors attached on or inside human body for monitoring
vital Health related problems e.g, Electro Cardiogram (ECG),
ElectroEncephalogram (EEG), ElectronyStagmography(ENG) etc. Data is recorded by
sensors and is sent towards Health care center. Due to life threatening
situations, timely sending of data is essential. For data to reach Health care
center, there must be a proper way of sending data through reliable connection
and with minimum delay. In this paper transmission delay of different paths,
through which data is sent from sensor to Health care center over heterogeneous
multi-hop wireless channel is analyzed. Data of medical related diseases is
sent through three different paths. In all three paths, data from sensors first
reaches ZigBee, which is the common link in all three paths. After ZigBee there
are three available networks, through which data is sent. Wireless Local Area
Network (WLAN), Worldwide Interoperability for Microwave Access (WiMAX),
Universal Mobile Telecommunication System (UMTS) are connected with ZigBee.
Each network (WLAN, WiMAX, UMTS) is setup according to environmental
conditions, suitability of device and availability of structure for that
device. Data from these networks is sent to IP-Cloud, which is further
connected to Health care center. Main aim of this paper is to calculate delay
of each link in each path over multihop wireless channel.Comment: BioSPAN with 7th IEEE International Conference on Broadband and
Wireless Computing, Communication and Applications (BWCCA 2012), Victoria,
Canada, 201
Neural Likelihoods via Cumulative Distribution Functions
We leverage neural networks as universal approximators of monotonic functions
to build a parameterization of conditional cumulative distribution functions
(CDFs). By the application of automatic differentiation with respect to
response variables and then to parameters of this CDF representation, we are
able to build black box CDF and density estimators. A suite of families is
introduced as alternative constructions for the multivariate case. At one
extreme, the simplest construction is a competitive density estimator against
state-of-the-art deep learning methods, although it does not provide an easily
computable representation of multivariate CDFs. At the other extreme, we have a
flexible construction from which multivariate CDF evaluations and
marginalizations can be obtained by a simple forward pass in a deep neural net,
but where the computation of the likelihood scales exponentially with
dimensionality. Alternatives in between the extremes are discussed. We evaluate
the different representations empirically on a variety of tasks involving tail
area probabilities, tail dependence and (partial) density estimation.Comment: 10 page
Self-organized network design by link survivals and shortcuts
One of the challenges for future infrastructures is how to design a network
with high efficiency and strong connectivity at low cost. We propose
self-organized geographical networks beyond the vulnerable scale-free structure
found in many real systems. The networks with spatially concentrated nodes
emerge through link survival and path reinforcement on routing flows in a
wireless environment with a constant transmission range of a node. In
particular, we show that adding some shortcuts induces both the small-world
effect and a significant improvement of the robustness to the same level as in
the optimal bimodal networks. Such a simple universal mechanism will open
prospective ways for several applications in wide-area ad hoc networks, smart
grids, and urban planning.Comment: 15 pages, 8 figures, 2 table
- …