scholarly journals Number Theoretic Model of Concurrent Access in Hypercube Interconnection Network

2021 ◽  
Vol 9 (9) ◽  
pp. 1166-1171
Author(s):  
Prof. Rakesh Kumar Katare
Keyword(s):  
Interconnection Network ◽  
Computing System ◽  
Inner Product ◽  
Theoretic Model ◽  
Gray Codes ◽  
Orthogonal Codes ◽  
Binary Coding ◽  
Communication Links ◽  
Orthogonal Property ◽  
The Individual

Abstract: This paper proposes a mathematical logical model to use shared communication links in the hypercube interconnection network. To achieve our objective we have used the orthogonal property of binary coding used to label the processing nodes of the hypercube and applied binary coding based multiplexing technique and the XOR logic operation to separate the individual processing nodes data from the multiplexed signal. Keywords: Gray codes, Hypercube, 1’s complement logic, GIG codes, bipolar codes, orthogonal codes, Normalized inner product, Parallel computing System.

scholarly journals Impact of Transparency in the Teamwork Development through Cloud Computing

2021 ◽  
Vol 11 (9) ◽  
pp. 3887
Author(s):  
María Luisa Sein-Echaluce ◽  
Angel Fidalgo-Blanco ◽  
Francisco José García-Peñalvo ◽  
David Fonseca
Keyword(s):  
Cloud Computing ◽  
Flipped Classroom ◽  
Active Role ◽  
Computing System ◽  
Individual Group ◽  
Learning Space ◽  
Level Of Involvement ◽  
Cloud Computing System ◽  
Common Learning ◽  
The Individual

Active educational methodologies promote students to take an active role in their own learning, enhance cooperative work, and develop a collective understanding of the subject as a common learning area. Cloud Computing enables the learning space to be supported while also revolutionizing it by allowing it to be used as a link between active methodology and students’ learning activities. A Cloud Computing system is used in conjunction with an active methodology to recognize and manage individual, group, and collective evidence of the students’ work in this research. The key hypothesis shown in this work is that if evidence management is made clear and evidence is consistently and gradually presented to students, their level of involvement will increase, and their learning outcomes will improve. The model was implemented in a university subject of a first academic year using the active Flipped Classroom methodology, and the individual, group and collective evidence is constantly worked with throughout the implementation of a teamwork method.

scholarly journals Almost periodic generalized functions

1983 ◽  
Vol 94 (1) ◽  
pp. 149-166
Author(s):  
H. Burkill ◽  
B. C. Rennie
Keyword(s):  
Generalized Functions ◽  
Inner Product ◽  
Almost Periodic ◽  
Test Functions ◽  
Complex Functions ◽  
Entire Complex ◽  
Order Of Magnitude ◽  
The Individual ◽  
Image Position ◽  
Derivatives Of

In (4) a space C of generalized functions was defined which is rather larger than the simple space used to such effect by Lighthill in (3). At the core of C is the space C0 = T of test functions. These are entire (complex) functions f such that all derivatives of f and its Fourier transform F have order of magnitude not exceeding as x → ± ∞, where c is a positive number depending on the individual derivative concerned. If f, g∈ T, the inner product 〈f | g〉 is defined to be

BROADCASTING IN BUS INTERCONNECTION NETWORKS

2000 ◽  
Vol 01 (02) ◽  
pp. 73-94
Author(s):  
A. FERREIRA ◽  
A. GOLDMAN ◽  
S. W. SONG
Keyword(s):  
Interconnection Networks ◽  
High Performance ◽  
Interconnection Network ◽  
Parallel Architectures ◽  
Interprocessor Communication ◽  
Efficient Manner ◽  
Graph Theoretic ◽  
Communication Algorithms ◽  
Communication Links ◽  
Point To Point

In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point interconnection network, usually modeled by a graph where processors are nodes and communication links are edges. Since interprocessor communication frequently constitutes serious bottlenecks, several architectures were proposed that enhance point-to-point topologies with the help of multiple bus systems so as to improve the communication efficiency. In this paper we study parallel architectures where the communication means are constituted solely by buses. These architectures can use the power of bus technologies, providing a way to interconnect much more processors in a simple and efficient manner. We present the hyperpath, hypergrid, hyperring, and hypertorus architectures, which are the bus-based versions of the well used point-to-point interconnection networks. Using (hyper) graph theoretic concepts to model inter-processor communication in such networks, we give optimal algorithms for broadcasting a message from one processor to all the others. For deriving high performance communication patterns we developed a new tool called simplification. The idea is to construct a graph, to be called representative graph, from the original hyper-topology, in such a way that it will become easy to describe and perform communication schemes to the former that will fit to the latter, because the simplification concept also allows us to partially use some already known communication algorithms for usual networks.

A Note on the Nature Diagnosability of Alternating Group Graphs Under the PMC Model and MM* Model

2018 ◽  
Vol 18 (01) ◽  
pp. 1850005 ◽  
Author(s):  
SHIYING WANG ◽  
LINGQI ZHAO
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Alternating Group ◽  
Multiprocessor System ◽  
Multiprocessor Systems ◽  
Free Node ◽  
Pmc Model ◽  
Important Study ◽  
Communication Links ◽  
Alternating Group Graph

Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No faulty set can contain all the neighbors of any fault-free node in the system, which is called the nature diagnosability of the system. Diagnosability of a multiprocessor system is one important study topic. As a favorable topology structure of interconnection networks, the n-dimensional alternating group graph AGn has many good properties. In this paper, we prove the following. (1) The nature diagnosability of AGn is 4n − 10 for n − 5 under the PMC model and MM* model. (2) The nature diagnosability of the 4-dimensional alternating group graph AG4 under the PMC model is 5. (3) The nature diagnosability of AG4 under the MM* model is 4.

From SOA to Pervasive Service Ecosystems

2012 ◽  
pp. 207-237 ◽  
Author(s):  
Mirko Viroli ◽  
Franco Zambonelli ◽  
Graeme Stevenson ◽  
Simon Dobson
Keyword(s):  
Pervasive Computing ◽  
Computing System ◽  
Semantic Web Technologies ◽  
Service Oriented Architectures ◽  
Pervasive Service ◽  
Service Oriented ◽  
Service Ecosystems ◽  
Open Service ◽  
The Individual ◽  
General Architecture

Emerging pervasive computing scenarios require open service frameworks promoting situated adaptive behaviors and supporting diversity in services and long-term ability to evolve. The authors argue that this calls for a nature-inspired approach in which pervasive services are modeled and deployed as autonomous individuals in an ecosystem of other services, data sources, and pervasive devices. They discuss how standard service-oriented architectures have to evolve to tackle the above issues, present a general architecture based on a shared spatial substrate mediating interactions of all the individual services of the pervasive computing system, and finally show that this architecture can be implemented relying primarily on standard W3C Semantic Web technologies, like RDF and SPARQL. A use case of adaptive pervasive displays for crowd steering applications is exploited as reference example.

scholarly journals An Experimental Study of Jury Decision Rules

2000 ◽  
Vol 94 (2) ◽  
pp. 407-423 ◽  
Author(s):  
Serena Guarnaschelli ◽  
Richard D. McKelvey ◽  
Thomas R. Palfrey
Keyword(s):  
Private Information ◽  
Large Fraction ◽  
Decision Rules ◽  
Theoretic Model ◽  
Quantal Response ◽  
Unanimity Rule ◽  
Group Data ◽  
Game Theoretic ◽  
The Individual ◽  
Jury Decision

We present experimental results on groups facing a decision problem analogous to that faced by a jury. We consider three treatment variables: group size (three or six), number of votes needed for conviction (majority or unanimity), and pre-vote deliberation. We find evidence of strategic voting under the unanimity rule: A large fraction of our subjects vote for a decision analogous to conviction even when their private information indicates a state analogous to innocence. This is roughly consistent with the game theoretic predictions of Feddersen and Pesendorfer. Although individual behavior is explained well by the game theoretic model, there are discrepancies at the level of the group decision. Contrary to Feddersen and Pesendorfer, in our experiments there are fewer outcomes analogous to incorrect convictions under unanimity rule than under majority rule. In the case of no deliberation, we simultaneously account for the individual and group data using quantal response equilibrium.

TASK ALLOCATION MODEL FOR RELIABILITY AND COST OPTIMIZATION IN DISTRIBUTED COMPUTING SYSTEM

2011 ◽  
Vol 02 (02) ◽  
pp. 131-149 ◽  
Author(s):  
PRADEEP KUMAR YADAV ◽  
M. P. SINGH ◽  
KULDEEP SHARMA
Keyword(s):  
Mathematical Model ◽  
Distributed Computing ◽  
Task Allocation ◽  
Cost Optimization ◽  
Computing System ◽  
System Efficiency ◽  
Allocation Model ◽  
Processing Elements ◽  
Communication Time ◽  
Communication Links

A Distributed Computing System (DCS) is defined as a set of processing elements interconnected by communication links. Reliability analysis of these processing elements and communication links is one of the important parameters to achieve the system efficiency. The system efficiency can be improved by making the task allocation properly in DCS. In this paper, we have presented a mathematical model, considering DCS with heterogeneous processors in order to achieve optimal cost and optimal reliability by allocating the tasks to the processors, in such a way that the allocated load on each processor is balanced. The task allocation in DCS is known as NP-hard problem even in the best conditions, and based on the present model, an efficient algorithm have been proposed to obtain optimal solutions. To design the mathematical model, execution time of the tasks on each processor as well as communication time between the tasks has been taken in the form of matrices.

scholarly journals On the Gauss-Green theorem

1968 ◽  
Vol 8 (3) ◽  
pp. 385-396 ◽  
Author(s):  
B. D. Craven
Keyword(s):  
Lebesgue Measure ◽  
Inner Product ◽  
Open Set ◽  
The Individual ◽  
Image Position ◽  
Vector Valued Function ◽  
Vector Valued ◽  
Dimensional Lebesgue Measure ◽  
Lebesgue Integration ◽  
Riemann Integration

In a previous paper [1], Green's theorem for line integrals in the plane was proved, for Riemann integration, assuming the integrability of Qx−Py, where P(x, y) and Q(x, y) are the functions involved, but not the integrability of the individual partial derivatives Qx and Py. In the present paper, this result is extended to a proof of the Gauss-Green theorem for p-space (p ≥ 2), for Lebesgue integration, under analogous hypotheses. The theorem is proved in the form where Ω is a bounded open set in Rp (p-space), with boundary Ω; g(x) =(g(x1)…, g(xp)) is a p-vector valued function of x = (x1,…,xp), continuous in the closure of Ω; μv,(x) is p-dimensional Lebesgue measure; v(x) = (v1(x),…, vp(x)) and Φ(x) are suitably defined unit exterior normal and surface area on the ‘surface’ ∂Ω and g(x) · v(x) denotes inner product of p-vectors.

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions

2019 ◽  
Vol 30 (08) ◽  
pp. 1301-1315 ◽  
Author(s):  
Liqiong Xu ◽  
Shuming Zhou ◽  
Weihua Yang
Keyword(s):  
Fault Tolerance ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Cayley Graphs ◽  
Disjoint Paths ◽  
Local Connectivity ◽  
Communication Links ◽  
Restricted Condition ◽  
Vertex Disjoint

An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. Connectivity is an important metric for fault tolerance of interconnection networks. A graph [Formula: see text] is said to be maximally local-connected if each pair of vertices [Formula: see text] and [Formula: see text] are connected by [Formula: see text] vertex-disjoint paths. In this paper, we show that Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected and are also [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have a triangle, [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have no triangles. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected if their corresponding transposition generating graphs have no triangles.

INFORMATION NETWORKS OF SMALL AND MEDIUM-SIZED ENTERPRISES

1999 ◽  
Vol 07 (03) ◽  
pp. 213-232 ◽  
Author(s):  
PETER WITT
Keyword(s):  
Information Management ◽  
Small Businesses ◽  
Information Networks ◽  
Small Enterprises ◽  
Business Partners ◽  
Network Position ◽  
Communication Links ◽  
Development Paths ◽  
The Individual ◽  
Start Ups

Information networks are established by communication links between firms, their business partners, personal friends, authorities, universities etc. The value of the information exchanges, especially for small and medium-sized enterprises, depends on the individual position in the information network. The paper discusses existing measures to evaluate network positions and proposes a new one. Extensive case study evidence indicates that the network position of startups and small enterprises is subject to constant changes which the individual firm cannot control completely. The paper develops a dynamic model for the development of network positions over time and indicates what firms can do to improve them. Information management in small and medium-sized enterprises can best be described as the management of dynamic information networks. Calculating position measures and development paths helps start-ups and small businesses to assess their current network position and to increase the efficiency of their information management.

Sign in / Sign up

Export Citation Format

Share Document