scholarly journals Trade-Off Considerations in Designing Efficient VLSI Feasible Interconnection Networks

VLSI Design ◽  
1995 ◽  
Vol 2 (4) ◽  
pp. 365-374 ◽  
Author(s):  
S. Q. Zheng ◽  
B. Cong ◽  
S. Bettayeb
Keyword(s):  
Parallel Computation ◽  
Interconnection Networks ◽  
Hybrid Networks ◽  
Massively Parallel ◽  
Star Graph ◽  
Trade Off ◽  
Vlsi Technology ◽  
Massively Parallel Computing ◽  
Better Than ◽  
Simple Combination

It is well known that the hypercube has a rich set of good properties, and consequently it has been recognized an ideal structure for parallel computation. Nevertheless, according to the current VLSI technology, the implementation feasibility of the hypercube remains questionable when the size of the hypercube becomes large. Recent research efforts have been concentrated on finding good alternatives to the hypercube. The star graph was shown having many desirable properties of the hypercube, and in several aspects, the star graph is better than the hypercube. However, we observe that the star graph as a network has several disadvantages, compared with the hypercube. In this paper, we propose a class of new networks, the star-hypercube hybrid networks (or the SH networks). The SH network is a simple combination of both the star graph and the hypercube. This class of networks contains the star graph and the hypercube as subclasses. We show that the SH network is an efficient and versatile network for parallel computation, since it shares properties of both the hypercube and the star graph, and remedies several major disadvantages of the hypercube and the star graph. This class of networks provide more flexibility in choosing the size, degree, number of vertices, degree of fault tolerance, etc. in designing massively parallel computing structures feasible for VLSI implementations.

scholarly journals A Novel Tradeoff Analysis between Traffic Congestion and Packing Density of Interconnection Networks for Massively Parallel Computers

2021 ◽  
Vol 11 (22) ◽  
pp. 10798
Author(s):  
M. M. Hafizur Rahman ◽  
Mohammed Al-Naeem ◽  
Mohammed Mustafa Ghowanem ◽  
Eklas Hossain
Keyword(s):  
Packing Density ◽  
Traffic Congestion ◽  
Interconnection Networks ◽  
Network Performance ◽  
Interconnection Network ◽  
Future Generation ◽  
Parallel Computer ◽  
Massively Parallel ◽  
Traffic Density ◽  
Trade Off

From disaster prevention to mitigation, drug analysis to drug design, agriculture to food security, IoT to AI, and big data analysis to knowledge or sentiment mining, a high computation power is a prime necessity at present. As such, massively parallel computer (MPC) systems comprising a large number of nodes are gaining popularity. To interconnect these huge numbers of nodes efficiently, hierarchical interconnection networks are an attractive and feasible option. A Tori-connected flattened butterfly network (TFBN) has been proposed by the authors in a prior work for future generation MPC systems. In the previous study, the static network performance and static cost-effectiveness were evaluated. In this research, a novel trade-off factor named message traffic congestion vs. packing density trade-off factor has been proposed, which characterizes the message congestion in the network and its packing density. The factor is used to statically assess the suitability of the implementation of an interconnection network. The message traffic density, packing density, and new factor have been evaluated for the proposed network and similar competitive networks such as TTN, TESH, 2D-Mesh, 3D-Mesh, 2D-Torus, and 3D-Torus. It has been found that the performance of the TFBN is superior to the other networks.

Robust and Efficient Custom Routing for Interconnection Networks with Distributed Shortcuts

2014 ◽  
Vol 5 (4) ◽  
pp. 51-74
Author(s):  
T. X. Le Nhat ◽  
T. Truong Nguyen ◽  
Khanh-Van Nguyen
Keyword(s):  
Interconnection Networks ◽  
Large Scale ◽  
Small World ◽  
Small World Networks ◽  
Link Failures ◽  
Traffic Demand ◽  
Large Scale Data ◽  
Massively Parallel Computing ◽  
Routing Mechanism ◽  
Better Than

We aim at creating a robust and efficient custom routing mechanism for Distributed Shortcut Networks (Nguyen et al., 2013), which address new challenging issues posed by recently advanced studies in the areas of massively parallel computing and large-scale data centers. We follow the design principles of Distributed Shortcut Networks (DSN), which construct non-random topologies with the creation of long-range shortcuts inspired by observations in small-world networks. However, we focus on designing a powerful custom routing mechanism which smartly exploits some precious properties of the topology. As a result, our new DSN-a network with a carefully refined routing logic performs significantly better than the basic DSN in term of communication latency while provides strengths in fault-tolerance as well as load-balance. These help the network become robust against link failures or burst of traffic demand while topology-agnostic deadlock-free routing (e.g. the famous up*/down* algorithm) suffers a lot.

Making the most of individual differences in joint decisions

2018 ◽  
Author(s):  
Bahador Bahrami
Keyword(s):  
Decision Making ◽  
Direct Evidence ◽  
Cross Cultural ◽  
Collective Decision Making ◽  
Wisdom Of Crowds ◽  
Trade Off ◽  
Adaptive Value ◽  
Joint Decisions ◽  
Cultural Data ◽  
Better Than

Evidence for and against the idea that “two heads are better than one” is abundant. This chapter considers the contextual conditions and social norms that predict madness or wisdom of crowds to identify the adaptive value of collective decision-making beyond increased accuracy. Similarity of competence among members of a collective impacts collective accuracy, but interacting individuals often seem to operate under the assumption that they are equally competent even when direct evidence suggest the opposite and dyadic performance suffers. Cross-cultural data from Iran, China, and Denmark support this assumption of similarity (i.e., equality bias) as a sensible heuristic that works most of the time and simplifies social interaction. Crowds often trade off accuracy for other collective benefits such as diffusion of responsibility and reduction of regret. Consequently, two heads are sometimes better than one, but no-one holds the collective accountable, not even for the most disastrous of outcomes.

scholarly journals The aerodynamic puzzle of nasalized fricatives: Aerodynamic and perceptual evidence from Scottish Gaelic

2015 ◽  
Vol 6 (2) ◽  
Author(s):  
Natasha Warner ◽  
Daniel Brenner ◽  
Jessamyn Schertz ◽  
Andrew Carnie ◽  
Muriel Fisher ◽  
...  
Keyword(s):  
Scottish Gaelic ◽  
Trade Off ◽  
Instrumental Data ◽  
The World ◽  
Perceptual Evidence ◽  
Better Than ◽  
Do So

AbstractScottish Gaelic is sometimes described as having nasalized fricatives (/ṽ/ distinctively, and [f̃, x̃, h̃], etc. through assimilation). However, there are claims that it is not aerodynamically possible to open the velum for nasalization while maintaining frication noise. We present aerodynamic data from 14 native Scottish Gaelic speakers to determine how the posited nasalized fricatives in this language are realized. Most tokens demonstrate loss of nasalization, but nasalization does occur in some contexts without aerodynamic conflict, e.g., nasalization with the consonant realized as an approximant, nasalization of [h̃], nasalization on the preceding vowel, or sequential frication and nasalization. Furthermore, a very few tokens do contain simultaneous nasalization and frication with a trade-off in airflow. We also present perceptual evidence showing that Gaelic listeners can hear this distinction slightly better than chance. Thus, instrumental data from one of the few languages in the world described as having nasalized fricatives confirms that the claimed sounds are not made by producing strong nasalization concurrently with clear frication noise. Furthermore, although speakers most often neutralize the nasalization, when they maintain it, they do so through a variety of phonetic mechanisms, even within a single language.

COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS

2010 ◽  
Vol 21 (03) ◽  
pp. 311-319 ◽  
Author(s):  
AYSUN AYTAC ◽  
ZEYNEP NIHAN ODABAS
Keyword(s):  
Complete Graph ◽  
Connected Graph ◽  
The Other ◽  
Trade Off ◽  
Number Of Components ◽  
Np Complete ◽  
Work Done ◽  
Better Than

The rupture degree of an incomplete connected graph G is defined by [Formula: see text] where w(G - S) is the number of components of G - S and m(G - S) is the order of a largest component of G - S. For the complete graph Kn, rupture degree is defined as 1 - n. This parameter can be used to measure the vulnerability of a graph. Rupture degree can reflect the vulnerability of graphs better than or independent of the other parameters. To some extent, it represents a trade-off between the amount of work done to damage the network and how badly the network is damaged. Computing the rupture degree of a graph is NP-complete. In this paper, we give formulas for the rupture degree of composition of some special graphs and we consider the relationships between the rupture degree and other vulnerability parameters.

scholarly journals Does Public Service Television Really Give Consumers Less Good Value for Money than the Rest of the Market?

2018 ◽  
Author(s):  
Patrick Barwise
Keyword(s):  
Public Service ◽  
Policy Implication ◽  
Value For Money ◽  
Trade Off ◽  
The Public ◽  
Consumer Value ◽  
Consumer Benefits ◽  
The Uk ◽  
Tv Commercial ◽  
Better Than

This chapter explores the assumption that public service television (PST), i.e. BBC TV, commercial public service broadcasters (PSBs), and non-PSBs, offers less consumer value for money than the rest of the market in the UK; that the only continuing rationale for PST rests on citizen concerns. It shows that PST does give citizens public service benefits over and above those provided by the non-PSBs and online-only TV players, and these ‘citizenship’ benefits are highly valued by the public. PST also offers consumers better value for money because the non-PSBs' significantly higher cost per viewer-hour seems unlikely to be compensated for by commensurately higher audience appreciation. The main policy implication is simple: there is no necessary trade-off between citizen and consumer benefits: pound for pound, PST appears to deliver both sets of benefits better than the rest of the market.

Sign in / Sign up

Export Citation Format

Share Document