Filters








91 Hits in 6.4 sec

A hypergraph partitioning based approach for scheduling of tasks with batch-shared I/O

Gaurav Khanna, Nagavijayalakshmi Vydyanathan, T. Kurc, U. Catalyurek, P. Wyckoff, J. Saltz, P. Sadayappan
2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
This paper proposes a novel, hypergraph partitioning based strategy to schedule multiple data analysis tasks with batchshared I/O behavior.  ...  This strategy formulates the sharing of files among tasks as a hypergraph to minimize the I/O overheads due to transferring of the same set of files multiple times and employs a dynamic scheme for file  ...  This paper focuses on scheduling of tasks with batch-shared I/O behavior [15] , in which files are shared across tasks in different pipelines. We propose a novel, hypergraph based approach.  ... 
doi:10.1109/ccgrid.2005.1558643 dblp:conf/ccgrid/KhannaVKCWSS05 fatcat:wrjvt2u4jbatvjwm6bm22dk54q

Balanced Scheduling of Independent File-Sharing Tasks in Heterogenous Environment

Ponsy
2011 Journal of Computer Science  
Approach: We propose hypergraph partitioning based strategy for the scheduling of non-critical jobs. This is done by scheduling the tasks that share tasks among them to the same processor.  ...  Problem statement: To examine the strategies for scheduling of independent file-sharing tasks in a heterogeneous environment and the concept of load balancing.  ...  In this study, we address the problem of scheduling the tasks in a heterogeneous environment. We propose a novel, hypergraph based approach along with load balancing.  ... 
doi:10.3844/jcssp.2011.1793.1797 fatcat:dyvvbb22g5eotmssfbandcsxiu

A Greedy Approach to Concurrent Processing of Frequent Itemset Queries [chapter]

Pawel Boinski, Marek Wojciechowski, Maciej Zakrzewicz
2006 Lecture Notes in Computer Science  
In this paper we formulate the problem of assigning the queries to phases as a particular case of hypergraph partitioning.  ...  If such data mining queries operate on overlapping parts of the database, then their overall I/O cost can be reduced by integrating their dataset scans.  ...  In the future we plan to extend our approach to allow for dynamic scheduling of arriving queries.  ... 
doi:10.1007/11823728_28 fatcat:fhykkpuafrez3cnrr5yzzoxcje

Hypergraph Partitioning for Automatic Memory Hierarchy Management

Sriram Krishnamoorthy, Umit Catalyurek, Jarek Nieplocha, Atanas Rountev, P. Sadayappan
2006 ACM/IEEE SC 2006 Conference (SC'06)  
A novel formulation of hypergraph partitioning is used to model the optimization problem of minimizing disk I/O.  ...  Experimental evaluation of the proposed approach using a sub-computation from the quantum chemistry domain shows a reduction in the disk I/O cost by up to a factor of 11, and a reduction in turnaround  ...  Acknowledgments We thank the National Science Foundation for the support of this research through grants 0121676, 0403342, and 0509467, and the U.S.  ... 
doi:10.1109/sc.2006.36 fatcat:2ojv3vlot5ggpisgh5ieehbs7y

Data management and query---Hypergraph partitioning for automatic memory hierarchy management

Sriram Krishnamoorthy, Umit Catalyurek, Jarek Nieplocha, Atanas Rountev, P. Sadayappan
2006 Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06  
A novel formulation of hypergraph partitioning is used to model the optimization problem of minimizing disk I/O.  ...  Experimental evaluation of the proposed approach using a sub-computation from the quantum chemistry domain shows a reduction in the disk I/O cost by up to a factor of 11, and a reduction in turnaround  ...  Acknowledgments We thank the National Science Foundation for the support of this research through grants 0121676, 0403342, and 0509467, and the U.S.  ... 
doi:10.1145/1188455.1188558 dblp:conf/sc/KrishnamoorthyCNRS06 fatcat:l3x5i4ir6vb37mspxaxplop3fy

Hypergraph+: An Improved Hypergraph-Based Task-Scheduling Algorithm for Massive Spatial Data Processing on Master-Slave Platforms

Bo Cheng, Xuefeng Guan, Huayi Wu, Rui Li
2016 ISPRS International Journal of Geo-Information  
In order to address these problems, an extended hypergraph-based task-scheduling algorithm, named Hypergraph+, is proposed for massive spatial data processing.  ...  Among the existing scheduling strategies, hypergraph-based algorithms capture the data sharing pattern in a global way and significantly reduce total communication volume.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/ijgi5080141 fatcat:nnlvwaofdrg3jkgxrfa3pjbpye

2005 IEEE International Symposium on Cluster Computing and the Grid

2005 CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005.  
in Multiclusters 784 Hashim Mohamed, Dick Epema A Hypergraph Partitioning Based Approach for Scheduling of Tasks with Batch-shared I/O 792 Umit Catalyurek, Gaurav Khanna, Nagavijayalakshimi Vydyanathan  ...  , Osmar Norberto de Souza A batch scheduler with high level components 776 Yiannis Georgiou, Olivier Richard, Pierre Neyron, Guillaume Huard, Cyrille Martin Experiences with the KOALA Co-Allocating Scheduler  ... 
doi:10.1109/ccgrid.2005.1558516 dblp:conf/ccgrid/X05a fatcat:jx2q5kkupnfppgxhajqxhxvllm

Heuristic Scheduling of Concurrent Data Mining Queries [chapter]

Marek Wojciechowski, Maciej Zakrzewicz
2005 Lecture Notes in Computer Science  
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed together.  ...  In this paper we introduce our heuristic algorithm called CCFull, which suboptimally schedules the data mining queries into a number of separate execution phases.  ...  ACC executes a set of data mining queries by integrating their I/O operations. It is based on the traditional Apriori approach to discover frequent itemsets.  ... 
doi:10.1007/11527503_38 fatcat:pf2z3wzvhfesdmrmbn7qdfam6e

A Survey On Data-Centric And Data-Aware Techniques For Large Scale Infrastructures

Silvina Caíno-Lores, Jesús Carretero
2016 Zenodo  
Large scale computing infrastructures have been widely developed with the core objective of providing a suitable platform for high-performance and high-throughput computing.  ...  As a result, we present an overview of locality-oriented techniques, which are grouped in four main categories: application development, task scheduling, in-memory computing and storage platforms.  ...  The added cost of inter-process communication for data redistribution is small compared with the savings in I/O time.  ... 
doi:10.5281/zenodo.1112257 fatcat:4l7qjgwdcrffddnwgb4dd3miuu

2020 Index IEEE Transactions on Parallel and Distributed Systems Vol. 31

2021 IEEE Transactions on Parallel and Distributed Systems  
., +, TPDS Aug. 2019 1826-1842 Disc storage Clip: A Disk I/O Focused Parallel Out-of-Core Graph Processing System.  ...  Poshtkohi, A., +, TPDS Feb. 2019 428-444 Parallelizing Word2Vec in Shared and Distributed Memory. Ji, S., +, TPDS Sept. 2019 2090-2100 Task-Based Augmented Contour Trees with Fibonacci Heaps.  ... 
doi:10.1109/tpds.2020.3033655 fatcat:cpeatdjlpzhqdersvsk5nmzjkm

Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O

G. Khanna, N. Vydyanathan, U. Catalyurek, T. Kurc, S. Krishnamoorthy, P. Sadayappan, J. Saltz
2006 15th IEEE International Conference on High Performance Distributed Computing  
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters.  ...  Two scheduling schemes are proposed: 1) a 0-1 Integer Programming (IP) based approach, which couples task scheduling and data replication, and 2) a bi-level hypergraph partitioning based heuristic approach  ...  The second approach, called BiPartition, employs a bi-level hypergraph partitioning based scheduling heuristic that formulates the sharing of files among tasks as a hypergraph.  ... 
doi:10.1109/hpdc.2006.1652155 dblp:conf/hpdc/KhannaVCKKSS06 fatcat:fjjimqogvjdyncrbztsmomcuom

P-Ride: A Shareability Prediction Based Framework in Ridesharing

Yu Chen, Liping Wang
2022 Electronics  
However, online-based methods perform poorly in service quality due to the neglect of the sharing relationship between requests, while batch-based methods fail in terms of efficiency.  ...  ., online-based and batch-based methods.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/electronics11071164 fatcat:6wv4znpdn5fmxnp7tzzysbfl6q

Piecing Together Large Puzzles, Efficiently: Towards Scalable Loading Into Graph Database Systems

Gabriel Campero Durand, Jingy Ma, Marcus Pinnecke, Gunter Saake
2018 Workshop Grundlagen von Datenbanken  
configuration of batching and partitioning.  ...  For this we implement a prototypical loader for a property graph DBMS, using a distributed message bus. With our implementation we evaluate the impact and limits of basic optimizations.  ...  For the task of loading there is a significant difference with respect to traditional partitioning approaches.  ... 
dblp:conf/gvd/DurandMPS18 fatcat:joffwprfozf4bdpiqbwzuh2hvi

Data Placement and Replica Selection for Improving Co-location in Distributed Environments [article]

K. Ashwin Kumar, Amol Deshpande, Samir Khuller
2013 arXiv   pre-print
We show effectiveness of our proposed approach by presenting results on a collection of synthetic and real workloads.  ...  We model a historical query workload trace as a hypergraph over a set of data items, and formulate and analyze the problem of replica placement by drawing connections to several well-studied graph theoretic  ...  [18] propose using replication along with declustering for achieving optimal parallel I/O for spatial range queries.  ... 
arXiv:1302.4168v1 fatcat:3xjxd6dakfembn4qfa6t72heo4

Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing [article]

Robert Ryan McCune, Tim Weninger, Gregory Madey
2015 arXiv   pre-print
In response, a new type of framework challenges one to Think Like A Vertex (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph.  ...  Such an approach improves locality, demonstrates linear scalability, and provides a natural way to express and compute many iterative graph algorithms.  ...  ACKNOWLEDGEMENTS This work was supported in part by the AFOSR Grant #FA9550-15-1-0003, as well as a Department of Education GAANN Fellowship awarded by the University of Notre Dame Department of Computer  ... 
arXiv:1507.04405v1 fatcat:t5unrl4pzvcv7jiqhiw7zscnra
« Previous Showing results 1 — 15 out of 91 results