Filters








1,887 Hits in 4.4 sec

Automatically Inserting Synchronization Statements in Divide-and-Conquer Programs

Pieter Hijma, Rob V. van Nieuwpoort, Ceriel J.H. Jacobs, Henri E. Bal
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
Divide-and-conquer is a well-known and important programming model that supports efficient execution of parallel applications on multi-cores, clusters and grids.  ...  In this paper, we investigate the possibility to automatically insert sync statements to relieve the programmer of the burden of thinking about synchronization.  ...  Both systems provide a divide-and-conquer programming model with asynchronous spawnable calls and a local barrier synchronization primitive called sync. Cilk differs from Satin in the base language.  ... 
doi:10.1109/ipdps.2011.272 dblp:conf/ipps/HijmaNJB11 fatcat:noz65gkfhba23nvoy6o3hk4pz4

Generating synchronization statements in divide-and-conquer programs

Pieter Hijma, Rob V. van Nieuwpoort, Ceriel J.H. Jacobs, Henri E. Bal
2012 Parallel Computing  
Divide-and-conquer is a well-known and important programming model that supports efficient execution of parallel applications on multi-cores, clusters, and grids.  ...  In this article, we investigate the feasibility of automatically inserting sync statements to relieve programmers of the burden of thinking about synchronization.  ...  Both systems provide a divide-and-conquer programming model with asynchronous spawnable calls and a local barrier synchronization primitive called sync. Cilk differs from Satin in the base language.  ... 
doi:10.1016/j.parco.2011.10.007 fatcat:74zknqs3mfexhncc2tfbst7tfi

Refactoring sequential Java code for concurrency via concurrent libraries

Danny Dig, John Marrero, Michael D. Ernst
2009 2009 IEEE 31st International Conference on Software Engineering  
The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threadsafe and scalable programs is hidden in the library.  ...  CONCURRENCER does not require any program annotations. Its transformations span multiple, non-adjacent, program statements.  ...  This work was funded in part by DARPA contract HR0011-07-1-0023.  ... 
doi:10.1109/icse.2009.5070539 dblp:conf/icse/DigME09 fatcat:h3uvfe5bjndfzkwlo6lkr76cna

Pattern programming approach for teaching parallel and distributed computing

Barry Wilkinson, Jeremy Villalobos, Clayton Ferner
2013 Proceeding of the 44th ACM technical symposium on Computer science education - SIGCSE '13  
Several patterns have been implemented including workpool, pipeline, synchronous and iterative all-to-all, and stencil.  ...  The goal is to promote higher-level structured design for parallel programming and make parallel programming easier and more scalable.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.  ... 
doi:10.1145/2445196.2445319 dblp:conf/sigcse/WilkinsonVF13 fatcat:fph3pakl45e7fmgdjnqzarmtxi

AutopaR: An Automatic Parallelization Tool for Recursive Calls

Mert Emin Kalender, Cem Mergenci, Ozcan Ozturk
2014 2014 43rd International Conference on Parallel Processing Workshops  
Our analysis module automatically collects program information without requiring any modification in the program design or developer involvement.  ...  Finally, it achieves automatic parallelization by introducing necessary OpenMP pragmas in appropriate places in the application.  ...  Parallelizing recursive functions can be very useful for divide and conquer algorithms.  ... 
doi:10.1109/icppw.2014.32 dblp:conf/icppw/KalenderMO14 fatcat:nxviv37jnngg3kf4zbux3l7pk4

Automatic parallelization of divide and conquer algorithms

Radu Rugina, Martin Rinard
1999 Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '99  
The compiler generates code that executes these calls in parallel. We have used the compiler to parallelize several programs that use divide and conquer algorithms.  ...  Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory hierarchies.  ...  Acknowledgements We w ould like to thank Nate Kushman, Darko Marinov, and Don Dailey for their help in generating the experimental results.  ... 
doi:10.1145/301104.301111 dblp:conf/ppopp/RuginaR99 fatcat:yw5zewvmkbc7jlgnbjkdcq2fmu

Automatic parallelization of divide and conquer algorithms

Radu Rugina, Martin Rinard
1999 SIGPLAN notices  
The compiler generates code that executes these calls in parallel. We have used the compiler to parallelize several programs that use divide and conquer algorithms.  ...  Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory hierarchies.  ...  Acknowledgements We w ould like to thank Nate Kushman, Darko Marinov, and Don Dailey for their help in generating the experimental results.  ... 
doi:10.1145/329366.301111 fatcat:xlblpipfmva5lb2nbni7b5sax4

Partitioning Strategy Divide and Conquer as CPANs. A Methodological Proposal

Mario Rossainz López, Manuel I. Capel Tuñón, Diego Sarmiento Rojas
2017 Research in Computing Science  
With the strategy divide and conquer as CPAN the parallel processing technique called n-Tree is used to parallelize sequential code that solve classic problems that can be partitioned by divide and conquer  ...  Particularly the implementation of the partitioning strategy divide and conquer as a CPAN using the object orientation paradigm is shown.  ...  The Technique of Divide and Conquer as a CPAN The technique of it Divide and Conquer it is characterized by the division of a problem in sub-problems that have the same form that the complete problem  ... 
doi:10.13053/rcs-145-1-2 fatcat:ght2zbz5tbhz7obd33h6y2svpq

Forklight: A control-synchronous parallel programming language [chapter]

Christoph W. Keßler, Helmut Seidl
1999 Lecture Notes in Computer Science  
parallel divide&conquer implementations.  ...  of parallel processes in the tradition and notation of PRAM algorithms.  ...  recursive divide{ and{conquer style as suggested in 5], 11], 17], 20], 21] is not supported.  ... 
doi:10.1007/bfb0100613 fatcat:fzfrsq6gkjdvjc6cjndue752na

An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications

Cristian Mateos, Alejandro Zunino, Marcelo Campo
2010 Computer languages, systems & structures  
There is a substantial body of efforts in the form of parallel libraries and frameworks that supply developers with programming tools to exploit parallelism in their applications.  ...  Motivated by the advent of powerful hardware such as SMP machines and execution environments such as Grids, research in parallel programming has gained much attention within the Distributed Computing community  ...  Acknowledgments We thank Cristian Clasadonte for his good predisposition and valuable help managing the computing infrastructure used for conducting the experiments described in this paper.  ... 
doi:10.1016/j.cl.2009.12.003 fatcat:235q7ihgpnbdph7ggx4gihgray

EasyFJP: Providing hybrid parallelism as a concern for divide and conquer java applications

Cristian Mateos, Alejandro Zunino, Mat´ıas Hirsch
2013 Computer Science and Information Systems  
One path to this end seems to be the synthesis of semi-automatic parallelism and Parallelism as a Concern (PaaC).  ...  In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for  ...  of applications, i.e., divide and conquer codes.  ... 
doi:10.2298/csis120712021m fatcat:opgqu3ty75etxjjnls72hl6w6y

Language and library support for practical PRAM programming

Christoph W. Keßler, Jesper Larsson Träff
1999 Parallel Computing  
Both language and library can be used with the SB-PRAM, an emulation of the PRAM in hardware.  ...  The two components of this project are a general-purpose PRAM programming language called Fork95, and a library, called PAD, of e cient, basic parallel algorithms and data structures.  ...  , parallel divide-and-conquer, and parallel pre x computation 10].  ... 
doi:10.1016/s0167-8191(98)00092-1 fatcat:7tix2v3xvnhtjpsrknqxwwouyi

Parallel Sorting System for Objects [article]

Samuel King Opoku
2012 arXiv   pre-print
Such traditional methods as exchange sort, divide and conquer sort, selection sort and insertion sort require supervisory control program.  ...  The supervisory control program has access to the items and is responsible for arranging them in the proper order.  ...  The popular traditional sorting algorithms are grouped as insertion; divide and conquer; bubble and selection [1] , [2] , [14] , [15] .  ... 
arXiv:1209.3050v1 fatcat:4l3hlkkgafffrdnok5nazwq3u4

PIE: A Programming and Instrumentation Environment for Parallel Processing

Z. Segall, L. Rudolph
1985 IEEE Software  
In order to facilitate the task of parallel programming, each component employs a set of new concepts and approaches to integrate functionality with performance concerns.  ...  In PIE, a system intensive rather than programmer intensive programming environment is promoted for supporting users with different experience in parallel programming.  ...  A particular instance of divide and conquer is when the subproblems are solved recursively.  ... 
doi:10.1109/ms.1985.232066 fatcat:65uzcpkzubhdhiwvn4lriucjwm

Flexible Scheduling and Thread Allocation for Synchronous Parallel Tasks

Christoph W. Kessler, Erik Hansson
2012 PARS Parallel-Algorithmen -Rechnerstrukturen und -Systemsoftware  
We describe atask model and dynamic scheduling and resource allocation mechanism for synchronous parallel tasks to be executed on SPMD-programmed synchronous shared-memory MIMD parallel architectures with  ...  In particular,o ur approach opens for automatic performance tuning at run-time by controlling the thread allocation for tasks based on run-time predictions.  ...  Acknowledgments This research is funded by VTT,project REPLICA, and by SeRC. We thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/bf03342029 fatcat:m26uvexwvvfnvibkgdg4tbeere
« Previous Showing results 1 — 15 out of 1,887 results