Filters








81,896 Hits in 3.8 sec

Scalable transactions in cloud data stores

Swati Ahirrao, Rajesh Ingle
2015 Journal of Cloud Computing: Advances, Systems and Applications  
Analytical and experimental results are observed and it shows that scalable workload-driven data partitioning outperforms the schema level and graph partitioning in terms of throughput, response time and  ...  This paper proposes a novel workload-aware approach, with scalable workload-driven data partitioning based on data access patterns of web applications for transaction processing.  ...  Figure 7 shows the throughput of scalable workload-driven partitioning, schema level and graph partitioning.  ... 
doi:10.1186/s13677-015-0047-3 fatcat:wzpjyljmxrgq7gxbo6ry4xs2q4

Scalable transactions in Cloud Data Stores

S. Ahirrao, R. Ingle
2013 2013 3rd IEEE International Advance Computing Conference (IACC)  
Analytical and experimental results are observed and it shows that scalable workload-driven data partitioning outperforms the schema level and graph partitioning in terms of throughput, response time and  ...  This paper proposes a novel workload-aware approach, with scalable workload-driven data partitioning based on data access patterns of web applications for transaction processing.  ...  Figure 7 shows the throughput of scalable workload-driven partitioning, schema level and graph partitioning.  ... 
doi:10.1109/iadcc.2013.6514205 fatcat:knxl66s3ergkdapavbzy4xsvjy

Data Partitioning in Mongo DB with Cloud

Aakanksha Jumle, Swati Ahirrao
2018 International Journal of Advances in Applied Sciences  
This paper implements the scalable workload-driven technique for polishing the scalability of web applications. The experiments are carried out over cloud using NoSQL data store MongoDB to scale out.  ...  The results of partitioning technique is conducted and evaluated using TPC-C benchmark.</p>  ...  In Section 4, Design of graph based workload driven partitioning system is presented.  ... 
doi:10.11591/ijaas.v7.i1.pp21-28 fatcat:6hjnaaznxvas5edrys456w2qu4

Graph Based Workload Driven Partitioning System by using MongoDB

Arvind Sahu, Swati Ahirrao
2018 International Journal of Advances in Applied Sciences  
In proposed system, Schism technique is used for partitioning the Graph. Schism is a workload aware graph partitioning technique.  ...  As RDBMS cannot handle the unstructured data and huge volume of data, so NoSQL is better choice for web applications. Graph database is one of the efficient ways to store data in NoSQL.  ...  In Section 4, Design of graph based workload driven partitioning system is presented.  ... 
doi:10.11591/ijaas.v7.i1.pp29-37 fatcat:id55zgd4wfeqreyzzhtuv7e7bi

A study of partitioning policies for graph analytics on large-scale distributed platforms

Gurbinder Gill, Roshan Dathathri, Loc Hoang, Keshav Pingali
2018 Proceedings of the VLDB Endowment  
This paper presents an experimental study of partitioning strategies for work-efficient graph analytics applications on large KNL and Skylake clusters with up to 256 machines using the Gluon communication  ...  When a graph is partitioned, a node in the graph may be replicated on several machines, and communication is required to keep these replicas synchronized.  ...  For powerlaw graphs, the adjacency matrix is irregular, and ensuring load balance for data-driven graph algorithms through static partitioning is difficult.  ... 
doi:10.14778/3297753.3297754 fatcat:k45yzcr46vcmfcu2uwrgblzzoa

Energy-driven distribution of signal processing applications across wireless sensor networks

Chung-Ching Shen, William L. Plishker, Dong-Ik Ko, Shuvra S. Bhattacharyya, Neil Goldsman
2010 ACM transactions on sensor networks  
This methodology explores efficient modeling techniques for DSP applications, including data sensing and processing; derives formulations of energy-driven partitioning (EDP) for distributing such applications  ...  To address such an energy-driven partitioning problem, this paper provides a new way of aggregating data and reducing communication traffic among nodes based on application analysis.  ...  In contrast to the above approaches, our proposed energy-driven analysis and partitioning for an application graph are targeted at the application level.  ... 
doi:10.1145/1754414.1754420 fatcat:yrdd2imqjvgrdbd5zsnmme5ncq

An Energy-Driven Design Methodology for Distributing DSP Applications across Wireless Sensor Networks

Chung-Ching Shen, William Plishker, Shuvra S. Bhattacharyya, Neil Goldsman
2007 28th IEEE International Real-Time Systems Symposium (RTSS 2007)  
This methodology explores efficient modeling techniques for DSP applications, including acoustic sensing and data processing; derives formulations of energy-driven partitioning for distributing such applications  ...  across wireless sensor networks; and develops efficient heuristic algorithms for finding partitioning results that maximize the network lifetime.  ...  In summary, solving the energy-driven partitioning problem means finding a partition cut of an application graph so that a master-slave WSN topology having maximum lifetime results from the partitioned  ... 
doi:10.1109/rtss.2007.32 dblp:conf/rtss/ShenPBG07 fatcat:nhumgukhyfhd3fmsypmvm2hvme

Dynamic Partitioning of Big Hierarchical Graphs

Vasilis Spyropoulos, Yannis Kotidis
2013 Very Large Data Bases Conference  
We built a framework on which we examine some basic policies for the partitioning of such graphs and draw interesting conclusions regarding the quality of the partitions produced and their effectiveness  ...  In this paper we deal with the management of records that are the edges of such a graph by describing a model that fits well in a number of applications, many of which deal with very big volumes of streaming  ...  In what follows we present the idea of Query-Driven Partitioning for hierarchical graphs in a formal way.  ... 
dblp:conf/vldb/SpyropoulosK13 fatcat:wczwmzao2vanbbtwkw7mz4y3fm

fpgaConvNet: A Toolflow for Mapping Diverse Convolutional Neural Networks on Embedded FPGAs [article]

Stylianos I. Venieris, Christos-Savvas Bouganis
2017 arXiv   pre-print
Across the range of applications, the performance needs vary significantly, from high-throughput video surveillance to the very low-latency requirements of autonomous cars.  ...  Graph partitioning with reconfiguration is tailored to high-throughput applications and achieves high throughput by partitioning a ConvNet along its depth and constructing one SDF subgraph per partition  ...  Similarly to graph partitioning with reconfiguration, this transformation partitions the SDFG into several subgraphs.  ... 
arXiv:1711.08740v1 fatcat:byjd5x72p5ekja5jjekms6knle

Optimizing load balance and communication on parallel computers with distributed shared memory [chapter]

Rudolf Berrendorf
1998 Lecture Notes in Computer Science  
Based on this data, a special graph is generated to which graph partitioning techniques are applied.  ...  The resulting partitioning is stored in a template which is used in subsequent executions of the program region to e ciently schedule the parallel tasks of that region.  ...  I would like to thank the developers of the graph partitioning libraries I used in my work, namely: George Karypis (Metis), Chris Walshaw (Jostle), Bruce A.  ... 
doi:10.1007/bfb0057866 fatcat:p5n74jasijcl5cf76nnmzdrtqu

Extension and application of an algorithm for systematic identification of weak coupling and partitions in dynamic system models

D. Geoff Rideout, Jeffrey L. Stein, Loucas S. Louca
2009 Simulation modelling practice and theory  
driven partitions.  ...  If separate bond graphs result, between which all modulating signals move from a "driving" subgraph to a "driven" one, then one-way coupling exists in the model and it can be separated into driving and  ...  Partition search algorithm Bond graph conditioning is followed by application of the partitioning algorithm as depicted in Fig. 9 .  ... 
doi:10.1016/j.simpat.2007.10.004 fatcat:p7wlafh37rbblatlamdpof5dbm

Optimizing Distributed Application Performance Using Dynamic Grid Topology-Aware Load Balancing

Gregory A. Koenig, Laxmikant V. Kale
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
While certain classes of applications, such as master-slave style or functional decomposition type applications, lend themselves well to running in Grid environments due to inherent latency tolerance,  ...  other classes of applications, such as tightly-coupled applications in which each processor regularly communicates with its neighboring processors, represent a significant challenge to deployment on Grids  ...  In this paper, we present a dynamic load balancing technique for Grid applications based on graph partitioning.  ... 
doi:10.1109/ipdps.2007.370225 dblp:conf/ipps/KoenigK07 fatcat:7vjfjaorsbblhopgw54yuzq3ry

Data-Driven Versus Topology-driven Irregular Computations on GPUs

Rupesh Nasre, Martin Burtscher, Keshav Pingali
2013 2013 IEEE 27th International Symposium on Parallel and Distributed Processing  
In this paper, we study data-driven and topology-driven implementations of six important graph algorithms on GPUs.  ...  Each operator application, called an activity, usually touches only a small part of the overall graph, so nonoverlapping activities can be performed in parallel.  ...  • Breadth-First Search (BFS): This graph problem is a key kernel in many important applications such as mesh partitioning.  ... 
doi:10.1109/ipdps.2013.28 dblp:conf/ipps/NasreBP13 fatcat:kmpc7fgnebfqjfjmqxhzwd4f7m

Reducing Data Movement on Large Shared Memory Systems by Exploiting Computation Dependencies

Isaac Sánchez Barrera, Miquel Moretó, Eduard Ayguadé, Jesús Labarta, Mateo Valero, Marc Casas
2018 Proceedings of the 2018 International Conference on Supercomputing - ICS '18  
Our approach, based on graph partitioning, adds negligible overhead and is able to provide performance improvements up to 1.52× and average improvements of 1.12× with respect to the best state-of-the-art  ...  We propose techniques at the runtime system level to further mitigate the impact of NUMA effects on parallel applications' performance.  ...  Considerations about Applying Graph Partitioning on Applications' TDGs To exploit the structure of the application we use graph partitioning algorithms.  ... 
doi:10.1145/3205289.3205310 dblp:conf/ics/BarreraMALVC18 fatcat:shndpuchkzagdo5z7ka7vkee6q

A fast weak motif-finding algorithm based on community detection in graphs

Caiyan Jia, Matthew B Carson, Jian Yu
2013 BMC Bioinformatics  
It is also capable of finding motifs in real applications. The source code for TFBSGroup can be obtained from  ...  Firstly, TFBSGroup transforms the (l, d) motif search in sequences to focus on the discovery of dense subgraphs within a graph.  ...  Recently, the sample-driven approach, which transforms the (l, d) motif search by extracting the maximum clique or q-cliques (q ≤ N) from an N-partite graph, has attracted much attention.  ... 
doi:10.1186/1471-2105-14-227 pmid:23865838 pmcid:PMC3726413 fatcat:kywgx633i5fpxpn2unzxhin4za
« Previous Showing results 1 — 15 out of 81,896 results