Filters








11,245 Hits in 4.3 sec

Optimistic parallelism benefits from data partitioning

Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2008 SIGPLAN notices  
Its main features are (i) two kinds of set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts  ...  Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism that arises from the use  ...  Constructs for optimistic parallelism The client code is not explicitly parallel; instead data parallelism is implicit, and is packaged into two constructs called optimistic set iterators. • Set iterator  ... 
doi:10.1145/1353536.1346311 fatcat:4dgolpsnibcwxmh2pejswxab2m

Optimistic parallelism benefits from data partitioning

Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2008 Proceedings of the 13th international conference on Architectural support for programming languages and operating systems - ASPLOS XIII  
Its main features are (i) two kinds of set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts  ...  Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism that arises from the use  ...  Constructs for optimistic parallelism The client code is not explicitly parallel; instead data parallelism is implicit, and is packaged into two constructs called optimistic set iterators. • Set iterator  ... 
doi:10.1145/1346281.1346311 dblp:conf/asplos/KulkarniPRWBC08 fatcat:3t4t4b2v25e7tjkphjha7ukvim

Optimistic parallelism benefits from data partitioning

Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2008 ACM SIGOPS Operating Systems Review  
Its main features are (i) two kinds of set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts  ...  Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism that arises from the use  ...  Constructs for optimistic parallelism The client code is not explicitly parallel; instead data parallelism is implicit, and is packaged into two constructs called optimistic set iterators. • Set iterator  ... 
doi:10.1145/1353535.1346311 fatcat:popdnb5dbjhb3ps27eagzwzbzu

Optimistic parallelism benefits from data partitioning

Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2008 SIGARCH Computer Architecture News  
Its main features are (i) two kinds of set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts  ...  Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism that arises from the use  ...  Constructs for optimistic parallelism The client code is not explicitly parallel; instead data parallelism is implicit, and is packaged into two constructs called optimistic set iterators. • Set iterator  ... 
doi:10.1145/1353534.1346311 fatcat:pdd26gnp2rb57f5tic33qnz53y

Parallelizing irregular algorithms

Pedro Monteiro, Miguel P. Monteiro, Keshav Pingali
2011 Proceedings of the 18th Conference on Pattern Languages of Programs - PLoP '11  
data structures such as lists and graphs.  ...  However, the parallel programming community has relatively little experience in parallelizing irregular applications, and we presently lack a deep understanding of the structure of parallelism and locality  ...  This work was partially supported by project PRIA -Parallel Refinements for Irregular Applications (UTAustin/CA/0056/ 2008) funded by Portuguese FCT/MCTES and FEDER.  ... 
doi:10.1145/2578903.2579141 dblp:conf/plop/MonteiroMP11 fatcat:de35ssngtvfozdzjn4fz6pprka

A pattern language for parallelizing irregular algorithms

Pedro Monteiro, Miguel P. Monteiro
2010 Proceedings of the 2010 Workshop on Parallel Programming Patterns - ParaPLoP '10  
Four patterns are proposed: Amorphous Data-Parallelism, Data-Parallel Graph, Optimistic Iteration and In-Order Iteration.  ...  Thus, opportunities for exploiting parallelism vary dynamically, according to how the algorithm changes data dependences.  ...  Benefit Implementing an optimistic execution technique from scratch can be costly.  ... 
doi:10.1145/1953611.1953624 fatcat:oi5g6iro6bckjjn5w7fky5xdri

Scheduling Issues in Optimistic Parallelization

Milind Kulkarni, Keshav Pingali
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize.  ...  Instead, we turn to optimistic parallelism, where regions of code are speculatively run in parallel while runtime mechanisms ensure proper execution.  ...  If conflicts are frequent, then optimistic parallelization provides no benefit, as execution will essentially serialize.  ... 
doi:10.1109/ipdps.2007.370491 dblp:conf/ipps/KulkarniP07 fatcat:dzfvmjrtajddrhogfgb3qwqiby

Mesh Generation and Optimistic Computation on the Grid [chapter]

Nikos Chrisochoides, Craig Lee, Bruce Lowekamp
2004 Performance Analysis and Grid Computing  
Mesh generation is the primary test application where boundary mesh cavities can be optimistically expanded in parallel.  ...  This paper describes the concept of optimistic grid computing.  ...  In the next section, we will introduce the concept of optimistic computation and the behavior that an application must exhibit to benefit from it.  ... 
doi:10.1007/978-1-4615-0361-3_14 fatcat:pvlbqxkzubewxnewt2azufvn3m

Structure-driven optimizations for amorphous data-parallel programs

Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali
2010 Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '10  
However, the overhead of optimistic parallel execution can be substantial.  ...  Recent work by the Galois project has provided a systematic approach for parallelizing irregular applications based on the idea of optimistic or speculative execution of programs.  ...  Hence, survey propagation not only benefits from cautiousness but requires it for good parallel performance.  ... 
doi:10.1145/1693453.1693457 dblp:conf/ppopp/Mendez-LojoNPSHKBP10 fatcat:gjbe6arypbgobfqj5uzdfzl5rm

Structure-driven optimizations for amorphous data-parallel programs

Mario Méndez-Lojo, Donald Nguyen, Dimitrios Prountzos, Xin Sui, M. Amber Hassaan, Milind Kulkarni, Martin Burtscher, Keshav Pingali
2010 SIGPLAN notices  
However, the overhead of optimistic parallel execution can be substantial.  ...  Recent work by the Galois project has provided a systematic approach for parallelizing irregular applications based on the idea of optimistic or speculative execution of programs.  ...  Hence, survey propagation not only benefits from cautiousness but requires it for good parallel performance.  ... 
doi:10.1145/1837853.1693457 fatcat:q22jyik7cfbrtdmcte6nlu4joy

Perils and pitfalls of parallel discrete-event simulation

Rajive L. Bagrodia
1996 Proceedings of the 28th conference on Winter simulation - WSC '96  
Common pitfalls in the parallel execution of the models are described together with suggestions on their avoidance.  ...  It describes the process of generating an efficient parallel implementation of a discrete-event simulation (DES) model.  ...  Thus from a PDES perspective, it may be preferable to use a partitioning that has a higher total communication cost that another provided that the former also has a smaller number of cycles among the partition  ... 
doi:10.1145/256562.256592 fatcat:v7dcu2tczzhgdgzhjodp6lv4ku

Modeling optimistic concurrency using quantitative dependence analysis

Christoph von Praun, Rajesh Bordawekar, Calin Cascaval
2008 Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming - PPoPP '08  
This work presents a quantitative approach to analyze parallelization opportunities in programs with irregular memory access where potential data dependences mask available parallelism.  ...  The model abstracts from runtime aspects such as scheduling, the number of threads, and concurrency control used in a particular parallelization.  ...  In a nutshell, the parallel execution of the application can benefit if a parallel scheduler that has knowledge of data dependencies between tasks can decide on several execution modes: sequential, optimistically  ... 
doi:10.1145/1345206.1345234 dblp:conf/ppopp/PraunBC08 fatcat:zv47yrhmqbfzhlthcr5e7yztpi

Optimism analysis of parallel queries in databases through multicores

P Mohankumar, P Kumaresan, J Vaideeswaran
2011 International Journal of Database Management Systems  
An optimistic analysis is made in this paper how to cover parallelism for database queries without suffering any loss and obtained desired response time.  ...  Thus it turned the research people interest how the peculiar queries for particular application can be resolved in an elapsed time slice optimistically. Ultimately it's parallelizing the process.  ...  , SQL Server looks for queries or index operations that might benefit from parallel execution.  ... 
doi:10.5121/ijdms.2011.3110 fatcat:aal433zn4bbklbxaknb5qwv5k4

Analyzing the impact of system architecture on the scalability of OLTP engines for high-contention workloads

Raja Appuswamy, Angelos C. Anadiotis, Danica Porobic, Mustafa K. Iman, Anastasia Ailamaki
2017 Proceedings of the VLDB Endowment  
In this paper, we perform a thorough analysis of the impact of other architectural alternatives (Data-oriented transaction execution, Partitioned Serial Execution, and Delegation) on scalability under  ...  can be scheduled to run on any core and can access any data or metadata stored in shared memory.  ...  Thus, as we increase the number of remote operations, we also access data from multiple remote partitions.  ... 
doi:10.14778/3149193.3149194 fatcat:cirxwunnifep3o6qny6rpmjcji

Parallel Logic Simulation of VLSI Systems

Roger D. Chamberlain
1995 Proceedings - Design Automation Conference  
This tutorial describes the current state-of-the-art in parallel logic simulation, including parallel simulation techniques, factors that impact simulation performance, performance results to date, and  ...  As a result, researchers are attempting to exploit parallel processing techniques to improve the performance of VLSI logic simulation.  ...  Data parallelism uses different processors to simulate the circuit for distinct input vectors.  ... 
doi:10.1109/dac.1995.250078 fatcat:6z2noirad5gllocr7vab4yokqu
« Previous Showing results 1 — 15 out of 11,245 results