Filters








6,626 Hits in 2.9 sec

Skew-Resistant Graph Partitioning

Angen Zheng, Alexandros Labrinidis, Christos Faloutsos
2017 2017 IEEE 33rd International Conference on Data Engineering (ICDE)  
Towards this, we introduce the idea of skew-resistant graph partitioning, where the objective is to create an initial partitioning that will "hold well" over time without suffering from skewness.  ...  Skewresistant graph partitioning tries to mitigate skewness by taking the characteristics of both the target workload and the graph structure into consideration.  ...  SKEW-RESISTANT GRAPH PARTITIONING In this section, we first introduce the Multi-Label Graph Partitioning (MLGP) problem (Section III-A) and then present an application of such idea to do Skew-Resistant  ... 
doi:10.1109/icde.2017.62 dblp:conf/icde/ZhengLF17 fatcat:e3ci5426xbaltg6syijd2nqwai

Parallel database systems: the future of high performance database systems

David DeWitt, Jim Gray
1992 Communications of the ACM  
Simple Relational Dataflow Graph Parallelization of Hash-Join • Sort-merge join does not work well if there is data skew • Hash-join is more resistant to data skew • To join 2 relations, we divide the  ...  Skew Problems • Data skew -The number of tuples vary widely across the partitions. • Execution skew -Due to data skew, more time is spent to execute an operation on partitions that contain larger numbers  ...  Database Machines and Grosch's Law Future Directions and Research Problems • Physical Database Design -Tools are needed to determine indexing and partitioning schemes given a database and its workload  ... 
doi:10.1145/129888.129894 fatcat:bau6dn5nivbgpdz3y5jx3f2gfy

Effective Resistance Preserving Directed Graph Symmetrization [article]

Katherine Fitch
2019 arXiv   pre-print
The application of effective resistance preserving graph symmetrization is discussed in the context of spectral graph partitioning and Kron reduction of directed graphs.  ...  Consequently a graph metric, square root of effective resistance, is preserved between the directed graph and its symmetrized version.  ...  Therefore, nodes in either partition are close to one another with respect to a graph metric.This is significant because the graph metric, square root of effective resistance, Fiedler vector partitioning  ... 
arXiv:1802.09829v2 fatcat:4x6w47usyrhc3m36ywoqf4xena

The P versus NP–complete dichotomy of some challenging problems in graph theory

Celina M.H. de Figueiredo
2012 Discrete Applied Mathematics  
More precisely, we have shown that Chvátal's skew partition is polynomial and that Roberts-Spencer's clique graph is NP-complete.  ...  Some open problems are discussed: the stubborn problem for list partition, the chromatic index of chordal graphs, and the recognition of split clique graphs.  ...  skew partition Instance: Graph G = (V , E).  ... 
doi:10.1016/j.dam.2010.12.014 fatcat:vou3y5m4izgzpcgze6ocw6llrm

Partitioning Graphs for the Cloud using Reinforcement Learning [article]

Mohammad Hasanzadeh Mofrad, Rami Melhem, Mohammad Hammoud
2019 arXiv   pre-print
In this paper, we propose Revolver, a parallel graph partitioning algorithm capable of partitioning large-scale graphs on a single shared-memory machine.  ...  The intuition behind using a vertex-centric view is that it naturally fits the graph partitioning problem, which entails that a graph can be partitioned using local information provided by each vertex's  ...  This unique feature makes LA scalable and resistant to increases in the number of partitions. J.  ... 
arXiv:1907.06768v2 fatcat:u666xe5n7rfppaytiicqpxz3wq

A parallel algorithm for zero skew clock tree routing

Zhaoyun Xing, Prithviraj Banerjee
1998 Proceedings of the 1998 international symposium on Physical design - ISPD '98  
skew wire-sizing algorithm.  ...  Previous works in zero skew clock tree routing assume that the wires have uniform size, and previous wire-sizing algorithms for general signal nets do not produce the exact zero skew.  ...  graph construction. 4.1.1.  ... 
doi:10.1145/274535.274552 dblp:conf/ispd/XingB98 fatcat:wqxmooqupvalflyydkz5wvn2su

Resisting Skew-Accumulation for Time-Stepped Applications in the Cloud via Exploiting Parallelism

Yu Zhang, Xiaofei Liao, Hai Jin, Geyong Min
2015 IEEE Transactions on Cloud Computing  
However, the existing solutions have focused only on the skew in each tick and thus cannot resist the accumulation of skew.  ...  To fill in this gap, an efficient approach to resisting the accumulation of skew is proposed in this paper via fully exploiting parallelism among ticks.  ...  For example, PowerGraph [21] tried to tackle the challenges of highly skewed power-law graphs for distributed graph applications, via partitioning and processing edges for each vertex over machines.  ... 
doi:10.1109/tcc.2014.2328594 fatcat:fge44ohvoneeho5glwphaeams4

2D Adaptive Grid-Based Image Analysis Approach for Biological Networks

Haifa F. Alhasson, Boguslaw Obara
2016 2016 IEEE 16th International Conference on Bioinformatics and Bioengineering (BIBE)  
In this paper, we present a novel approach for a weighted and undirected graph-based network reconstruction and quantification from 2D images using an adaptive rectangular mesh refinement approach.  ...  Effective resistance Defined as a function of the Laplacian eigenvalues of the graph, calculated as a sum of the effective resistances over all pairs of vertices.  ...  (c) Skewness of degree distribution. (d) Assorativity. (e) Average path length. (f) Skewness of the shortest path lengths. (g) Minimum graph eccentricity (radius). (h) Longest short path (diameter).  ... 
doi:10.1109/bibe.2016.17 dblp:conf/bibe/AlhassonO16 fatcat:od66otlirjam3peno2jedhjsga

An efficient zero-skew routing algorithm

Masato Edahiro
1994 Proceedings of the 31st annual conference on Design automation conference - DAC '94  
Our algorithm generates a zero-skew routing for 3000-pin benchmark data within 5 seconds on a 90MIPS RISC workstation.  ...  There are two signicant characteristics in this partitioning method.  ...  2 w 2 cl 2 w 2 2 + C(v 2 ) + (v 2 ); C(v) = C(v 1 ) + C ( v 2 ) + c ( l 1 w 1 + l 2 w 2 ) ; where l 1 (l 2 ) and w 1 (w 2 ) are length and width of the wire from v to v 1 (v 2 ), and r and c are wire resistance  ... 
doi:10.1145/196244.196426 dblp:conf/dac/Edahiro94 fatcat:k33kxgj7vvgsjkifhxrcnwqbka

Skew handling in the DBS3 parallel database system [chapter]

Luc Bouganim, Daniela Florescu, Benoît Dageville
1996 Lecture Notes in Computer Science  
It makes DBS3 almost insensitive to data skew and allows decoupling the degree of parallelism from the degree of data partitioning.  ...  and degree of partitioning.  ...  This strategy resists to bad data distributions but may yield high overhead, especially with limited memory size. The problem reduces to that of grain of parallelism.  ... 
doi:10.1007/3-540-61695-0_9 fatcat:vr3s6ptrczbpbdpmpth3hmswnm

Selectivity estimation in spatial databases

Swarup Acharya, Viswanath Poosala, Sridhar Ramaswamy
1999 SIGMOD record  
We propose several techniques based on using spatial indices, histograms, binary space partitionings (BSPs), and the novel notion of spatial skew.  ...  The Min-Skew partitioning can be constructed efficiently, occupies very little space, and provides accurate selectivity estimates over a broad range of spatial queries.  ...  We now propose a novel technique for constructing skew-resistant binary space partitionings.  ... 
doi:10.1145/304181.304184 fatcat:kkxn2m3wbrh5vdhg4abapeg3a4

Selectivity estimation in spatial databases

Swarup Acharya, Viswanath Poosala, Sridhar Ramaswamy
1999 Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD '99  
We propose several techniques based on using spatial indices, histograms, binary space partitionings (BSPs), and the novel notion of spatial skew.  ...  The Min-Skew partitioning can be constructed efficiently, occupies very little space, and provides accurate selectivity estimates over a broad range of spatial queries.  ...  We now propose a novel technique for constructing skew-resistant binary space partitionings.  ... 
doi:10.1145/304182.304184 dblp:conf/sigmod/AcharyaPR99 fatcat:wwfh6urovjb5reqtlz7cejbzem

Concurrency Protocol Aiming at High Performance of Execution and Replay for Smart Contracts [article]

Shuaifeng Pang, Xiaodong Qi, Zhao Zhang, Cheqing Jin, Aoying Zhou
2019 arXiv   pre-print
Also, a graph partition algorithm is devised to divide the original schedule log into small pieces and further reduce the communication cost; and (ii) in the second phase, we give a deterministic OCC protocol  ...  The speedup of Partition Validator in Figure 8 follows the similar trend which indicates the protocol is resistant for the change of conflict rate.  ...  Partition validator performs a speedup of 11x steadily regardless of the skew parameter.  ... 
arXiv:1905.07169v1 fatcat:sl6hem7j5zezraqqkx432ehdau

Efficient On-Chip Communication for Parallel Graph-Analytics on Spatial Architectures [article]

Khushal Sethi
2021 arXiv   pre-print
Spatial Architectures have been promising in the execution of Graph Processing, where the graph is partitioned into several nodes and each node works in parallel.  ...  To mitigate the bottleneck we propose a novel power-law aware Graph Partitioning and Data Mapping scheme to reduce the communication latency by minimizing the hop counts on a scalable network-on-chip.  ...  Graph Partitioning to Nodes : The graph is partitioned in a source-cut (edge) fashion. As a first step, the vertices are sorted by descending order of degree, for ease.  ... 
arXiv:2108.11521v1 fatcat:zpzqyfaf5ncm3jq77dbxc7mu6y

On Small World Graphs in Non-uniformly Distributed Key Spaces

S. Girdzijauskas, A. Datta, K. Aberer
2005 21st International Conference on Data Engineering Workshops (ICDEW'05)  
Inspired by we extend the model of building "routing-efficient" small-world graphs and propose two new models.  ...  In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs.  ...  Thus in such an overlay network, both routing latency and number of routing states per peer stay O(log(N )) independent of the skew of the keyspace partition.  ... 
doi:10.1109/icde.2005.254 dblp:conf/icde/GirdzijauskasDA05 fatcat:oojeomsevrhspdfvcxcm7gbjmu
« Previous Showing results 1 — 15 out of 6,626 results