8,243 Hits in 5.3 sec

A comparative performance analysis of n-cubes and star graphs

A.E. Kiasari, H. Sarbazi-Azad
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
We have compared the performance of the star and hypercube networks for different message length and virtual channels and considered two implementation constraints, namely the constant bisection bandwidth  ...  The comparison results reveal that the star graph has a better performance compared to the equivalent hypercube under light traffic loads while the opposite conclusion is reached for heavy traffic loads  ...  Section 4 presents the comparative performance analysis of the hypercube and star graph under technological implementation constraints. Finally, Section 5 concludes the paper.  ... 
doi:10.1109/ipdps.2006.1639643 dblp:conf/ipps/KiasariS06 fatcat:4sitwp2vnbf2xpbxesortbkct4

Star varietal cube: A New Large Scale Parallel Interconnection Network

Binod Nag, Debendra Pradhan, Nirmal Keshari Swain, Nibedita Adhikari
2011 International Journal of Communication Networks and Security  
The Star graph of dimension n and a Varietal hypercube of dimension m are used as building blocks.  ...  The diameter of the Star varietal hypercube is about two third of the diameter of the Star-cube. The average distance of the proposed topology is also smaller than that of the Star-cube.  ...  Tripathy, Dept. of CSE & IT for his encouragement and technical guidance throughout the research work.  ... 
doi:10.47893/ijcns.2011.1018 fatcat:jfcjaijs3rdffhqup3inuskmcy


Raj Kumar Gupta, K.L. Jaiswal
2021 International Journal of Engineering Technologies and Management Research  
Cube architecture is one of the key aspects of network integration that explore and create networks of cubes. They praise and work together to complete all network management tasks.  ...  The topology of network connections has become a vital step in the implementation of all conventional network networks.  ...  Jaiswal STAR CROSSED CUBE SCC (k, m) is a multigraph CC (m) and an n-sided star graph S (n).  ... 
doi:10.29121/ijetmr.v8.i1.2021.872 fatcat:4el5lj3qhzbrflozsucttnaqjm

Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs

Joubert de Castro Lima, Celso Massaki Hirata
2011 Information Sciences  
MCG performance analysis demonstrates that MCG is 20-40% faster than Dwarf, Star and MDAG approaches when computing sparse data cubes.  ...  In general, redundant sub-graphs are quite common in a data cube, but eliminating them is a hard problem. Dwarf, Star and MDAG approaches only eliminate some specific common sub-graphs.  ...  The performance results and analysis are presented in Section 4.  ... 
doi:10.1016/j.ins.2010.05.012 fatcat:5tc5guji2jajfj3bn5wabxewla

Linear Crossed Cube (LCQ): A New Interconnection Network Topology for Massively Parallel System

Zaki A. Khan, Jamshed Siddiqui, Abdus Samad
2015 International Journal of Computer Network and Information Security  
This paper proposed and analyzed a new scalable interconnection network topology named as Linear Crossed Cube (LCQ).  ...  To compare the performance of proposed LCQ, standard scheduling scheme is also implemented on other similar multiprocessor architectures.  ...  A S (n, m) is edges-symmetric, maximally fault tolerant and cost effective. The Star crossed cube S (m, n) is derived from product of Star graph and Crossed cube.  ... 
doi:10.5815/ijcnis.2015.03.03 fatcat:pdanyyal45gpvmvclmzwpe3iwm

Star-crossed cube: an alternative to star graph

Nibedita ADHIKARI, Chitta Ranjan TRIPATHY
2014 Turkish Journal of Electrical Engineering and Computer Sciences  
Definition 1 The IN is a finite graph G = { V, E } , where V and E are a set of n tuples, v 1 v 2 ..v n and e 1 , e 2 ,. . . e n , respectively.  ...  The current study proposes a new class of IN topology called the star-CQ (SCQ(m,n)). It is a product graph on the nstar and m-dimensional CQ (CQ(m)).  ...  2dsc (m+n−1) 2dscq (m+n−1) Performance analysis In this section, 2 important measures of performance of the proposed network, namely the cost effectiveness factor (CEF) and the time cost effectiveness  ... 
doi:10.3906/elk-1202-44 fatcat:l5m3ppir6vbvdgym3nmcghy73i

Reliable, Effective and Fault-Tolerant Design of Leafy Cube Interconnection Network Topology

The various performance parameters of the LC network are studied and compared with the existing HC and its variants.  ...  The routing and broadcasting algorithms are proposed and the time complexities are also compared.  ...  Several variation of star graph like Starcube and Star crossed cube try to bridge the gap in between two consecutive levels of n-star.  ... 
doi:10.35940/ijitee.l2707.1081219 fatcat:rdbhx2qidve25m2gxs6e6oaizi

Optimizing RDF Data Cubes for Efficient Processing of Analytical Queries

Kim Ahlstrøm Jakobsen, Alex B. Andersen, Katja Hose, Torben Bach Pedersen
2015 International Semantic Web Conference  
In today's data-driven world, analytical querying, typically based on the data cube concept, is the cornerstone of answering important business questions and making data-driven decisions.  ...  Traditionally, the underlying analytical data was mostly internal to the organization and stored in relational data warehouses and data cubes.  ...  When evaluating a BGP, {(s 1 , p 1 , o 1 ) , (s 2 , p 2 , o 2 ) , . . . , (s n , p n , o n )} over a graph G we use the notation G (s 1 p 1 o 1 . s 2 p 2 o 2 . . . . . s n p n o n ).  ... 
dblp:conf/semweb/JakobsenAHP15 fatcat:d74jjqt6hrh2rdzuwrou3yxeyy

Online Analytical Processsing on Graph Data [article]

Leticia Gómez, Bart Kuijpers, Alejandro Vaisman
2019 arXiv   pre-print
This paper proposes a formal multidimensional model for graph analysis, that considers the basic graph data, and also background information in the form of dimension hierarchies.  ...  Furthermore, OLAP operations and models can expand the possibilities of graph analysis beyond the traditional graph-based computation.  ...  Proof 1 Let C be a data cube, and let Star(C) be its star-graphoid.  ... 
arXiv:1909.01216v1 fatcat:mtnijugsxrh3jisdojyzdti3wy

Quantile Plots of the Prediction Variance for Partially Replicated Central Composite Design

Ngozi C. Umelo-Ibemere, Harrison O. Amuji
2015 International Journal of Statistics and Probability  
The prediction variance of two variations of the partially replicated central composite design (replicated cube plus one star and one cube plus replicated star) are compared using the quantile plots.  ...  For face-centred (α = 1) and rotatable (α = F 1 4 ) central composite designs, the prediction variance of the one cube plus replicated star perform better than the replicated cube plus one star.  ...  But for p > 0.4, n α = 2, n α = 3 and n α = 4 perform better than n F = 2, n F = 3 and n F = 4 respectively. Also, the plots of the replicated cubes plus one star depict large dispersion.  ... 
doi:10.5539/ijsp.v4n2p55 fatcat:muhgzaldbjc4jp4jbnug2lyjcq

A Graph-oriented Framework for Online Analytical Processing

2022 International Journal of Advanced Computer Science and Applications  
The same dataset is stored in a relational data warehouse in order to compare storage space and query performance.  ...  Second, we propose a data cube materialization through the precomputation of aggregated nodes.  ...  The Graph-OLAP implementation is compared to ROLAP one in terms of query performance and storage space, results show clearly that graph implementation of OLAP presents better performances than relational  ... 
doi:10.14569/ijacsa.2022.0130564 fatcat:lx6xxrgmhzdolkhnuda7owsfdy

Page 8114 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
Analysis has shown that star graphs are markedly superior to the widely used n-cube.  ...  Finally, the topology can systematically interconnect an arbitrary number of nodes and its scalability, diameter and communications performance compare favourably with those of the n-cube and its variants  ... 

A framework for designing deadlock-free wormhole routing algorithms

R.V. Boppana, S. Chalasani
1996 IEEE Transactions on Parallel and Distributed Systems  
An analysis of the resource requirements and performances of a proposed algorithm, called negative-hop algorithm, with some of the previously proposed algorithms for torus and mesh networks is presented  ...  The hop-based wormhole algorithms can be applied to a variety of networks including torus, mesh, de Brujin, and a class of Cayley networks, with the best known bounds on virtual channels for minimal routing  ...  Chalsani's research has been supported in part by a grant from the graduate school of the University of Wisconsin-Madison, and by NSF Grants CCR-9308966 and ECS-9216308.  ... 
doi:10.1109/71.485506 fatcat:hedproogcrhizm6cmhh3zdq4oa

$\mathcal {Q}^{+}$: characterizing the structure of young star clusters

S. E. Jaffa, A. P. Whitworth, O. Lomax
2016 Monthly notices of the Royal Astronomical Society  
We present a new algorithm for statistically analysing the distribution of stars to quantify the level of sub-structure.  ...  (iii) The volume-density scaling exponent, C=-d[δ n]/d[L] measures the factor by which the excess density, δ n, in a structure of scale L, exceeds that of the background formed by larger structures; it  ...  I N T RO D U C T I O N The Q-parameter (Cartwright & Whitworth 2004; hereafter CW04) uses the complete graph and minimum spanning tree (MST) to quantify the structure of a star cluster, and can separate  ... 
doi:10.1093/mnras/stw3140 fatcat:n6rk5eitmjfb5fahhdmpjptbyq

Dimensional Modeling of Indian Materials Database

Suja Ramachandran, S. Rajeswari, S.A.V. Satya Murty
2012 International Journal of Computer Applications  
This paper discusses the model and architecture of the material database using a "Snowflake Schema", which is a variation of "Star Schema", where some of the dimensions are normalized into multiple related  ...  Dimensional modeling of data results in a "Star Schema", where the data constitutes a central fact table surrounded by dimension tables.  ...  Baldev Raj, our former director and Mr. S.C. Chetal, our current director for their support and encouragement.  ... 
doi:10.5120/4617-4834 fatcat:srny42dhp5f3pjsdtpy2sc5rja
« Previous Showing results 1 — 15 out of 8,243 results