4,752 Hits in 4.9 sec

Fast GPU bounding boxes on tree-structured scenes [article]

Raph Levien
2022 arXiv   pre-print
This paper presents a fast and practical solution, with a new algorithm for the classic parentheses matching problem at its core.  ...  These are straightforward to compute on the CPU using a sequential algorithm, but an efficient, parallel GPU algorithm is more elusive.  ...  Given the tree structure as computed by parentheses matching, we also present a efficient parallel algorithm for computing intersections and unions of bounding boxes, flowing data down and up the tree,  ... 
arXiv:2205.11659v1 fatcat:drsbhl4debdfjkt6dsomszhiae

Efficient EREW PRAM algorithms for parentheses-matching

S.K. Prasad, S.K. Das, C.C.-Y. Chen
1994 IEEE Transactions on Parallel and Distributed Systems  
These algorithms provide new insights into the parentheses-matching problem.  ...  We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model.  ...  Sahni and the anonymous referees for suggesting inclusion of some important references.  ... 
doi:10.1109/71.308536 fatcat:c72flyzxwjeslhkw56teqvucmy

Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

Maan Haj Rachid, Qutaibah Malluhi, Mohamed Abouelhoda
2014 BioMed Research International  
Furthermore, we present a parallel algorithm to provide more speed for shared memory computers.  ...  In this paper, we present a space-economical solution to this problem using the generalized Sadakane compressed suffix tree.  ...  The statements made herein are solely the responsibility of the authors.  ... 
doi:10.1155/2014/745298 pmid:24834435 pmcid:PMC4009283 fatcat:p3bk5q44yng25ivkj2l4xi5fuy

Page 3264 of Mathematical Reviews Vol. , Issue 2004d [page]

2004 Mathematical Reviews  
parallel algo- rithm for parentheses matching (9 pp.); David B.  ...  Zhang, A new efficient parallel algorithm for computing eigenvalues of symmet- ric tridiagonal matrices (14 pp.); Dror Irony and Sivan Toledo, Communication-efficient parallel dense LU using a 3-dimensional  ... 

Adaptive Massively Parallel Constant-round Tree Contraction [article]

MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su
2021 arXiv   pre-print
Miller and Reif's FOCS'85 classic and fundamental tree contraction algorithm is a broadly applicable technique for the parallel solution of a large number of tree problems.  ...  Additionally it is also used as an algorithmic design technique for a large number of parallel graph algorithms.  ...  Working efficiently regardless of using only unary contracting functions is the reason Tree Contraction was considered a fundamental framework for designing parallel algorithms on trees in more restricted  ... 
arXiv:2111.01904v1 fatcat:mjwqdg3ppfdpnagl6rzaxd4pkq

The reduce-or process model for parallel execution of logic programs

Laxmikant V. Kalé
1991 The Journal of Logic Programming  
A method for parallel execution of logic programs is presented. It uses REDUCE-OR trees instead of AND-OR or SLD trees.  ...  The REDUCE-OR process model is derived from the tree representation by providing a process interpretation of tree development, and devising efficient bookkeeping mechanisms and algorithms.  ...  A simple completion-detection algorithm is described in [201. An efficient version of this has been developed and used in an interpreter for the ROPM.  ... 
doi:10.1016/0743-1066(91)90009-e fatcat:qc4zkxgae5d5hcysruorgneroi

Parallel graph algorithms

Michael J. Quinn, Narsingh Deo
1984 ACM Computing Surveys  
The problems discussed relate to searching graphs and finding connected components, maximal chques, maximum cardinahty matchings, mimmum spanning trees, shortest paths, and travehng salesman tours.  ...  Most algorithms use relatwely simple data structures, such as the adjacency matrix and adjacency hsts, although a few algorithms using linked hsts, heaps, and trees are also discussed.  ...  Denbigh Starkey and Karl Winklmann for their careful reading of the manuscript and their constructive suggestions.  ... 
doi:10.1145/2514.2515 fatcat:vcxpxbxty5cixamq6pplo4i66m

Statistics-based parallelization of XPath queries in shared memory systems

Rajesh Bordawekar, Lipyeow Lim, Anastasios Kementsietsidis, Bryant Wei-Lun Kok
2010 Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10  
For a given XPath query, our parallelization algorithm uses XML statistics to estimate the relative efficiencies of these different alternatives and find an optimal parallel XPath processing plan.  ...  However, simply executing multiple XML queries over multiple cores merely addresses the throughput issue: intra-query parallelization is needed to exploit multiple processing cores for better latency.  ...  For each dataset and each query in the testing set for that dataset, we use our parallelization algorithm to identify the candidate partitioning points and strategies.  ... 
doi:10.1145/1739041.1739063 dblp:conf/edbt/BordawekarLKK10 fatcat:fed7hp3g2zcfrmxquyyvdg35ii

Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism

Qi Wang, Meixian Chen, Yu Liu, Zhenjiang Hu
2013 Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing - FHPC '13  
Besides, balanced tree partition strategies are discussed for efficient parallel computing.  ...  We propose to derive bottom-up dynamic programming algorithms on tree decompositions from the user-specified GTA algorithms, and further transform the bottom-up algorithms to parallel ones which run in  ...  Tree parallelization Using tree decomposition, we are able to reduce algorithms for some graph problems to algorithms on tree decompositions (trees).  ... 
doi:10.1145/2502323.2502331 dblp:conf/icfp/WangCLH13 fatcat:3ypmn7swrrho7nplv23xbfgjle

The generalized matrix chain algorithm

Henrik Barthels, Marcin Copik, Paolo Bientinesi
2018 Proceedings of the 2018 International Symposium on Code Generation and Optimization - CGO 2018  
In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works  ...  The standard matrix chain problem consists in finding the parenthesization of a matrix product M := A_1 A_2 ... A_n that minimizes the number of scalar operations.  ...  We thank Ryan Curtin for helpful discussions on how the matrix chain problem is solved in Armadillo. We thank Sadulla Aghayev and Edilbert Christhuraj for providing the example in Sec. 3.3.  ... 
doi:10.1145/3168804 dblp:conf/cgo/BarthelsCB18 fatcat:wujdubq2mzd6jfvpw3qt6lwgc4

Non-interleaving bisimulation equivalences on Basic Parallel Processes

Sibylle Fröschle, Petr Jančar, Slawomir Lasota, Zdeněk Sawa
2010 Information and Computation  
The common general scheme of both algorithms is based on a fixpoint characterization of the equivalences for tree-like labelled event structures.  ...  We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n 3 log n)) and history preserving bisimilarity (in O(n 6 )) on the class Basic Parallel Processes.  ...  There is an algorithm solving bpp-hp-bisim (i.e., computing P hp ( ) for a given BPP system ) in time O(n 6 ).  ... 
doi:10.1016/j.ic.2009.06.001 fatcat:ruhh53wxpbgd7ajomczkbszn7m

A study on optimally co-scheduling jobs of different lengths on chip multiprocessors

Kai Tian, Yunlian Jiang, Xipeng Shen
2009 Proceedings of the 6th ACM conference on Computing frontiers - CF '09  
For large problems, we design and evaluate two approximation algorithms, A*-cluster and local-matching algorithms, to effectively approximate the optimal schedules with good accuracy and high scalability  ...  This study contributes better understanding to the optimal co-scheduling problem, facilitates the evaluation of coscheduling systems, and offers insights and techniques for the development of practical  ...  The first strategy reduces the height of the search tree, while the second strategy reduces the width.  ... 
doi:10.1145/1531743.1531752 dblp:conf/cf/TianJS09 fatcat:uahpkxe3g5dr5lwdc3azqpofyu

Parallel parsing made practical

Alessandro Barenghi, Stefano Crespi Reghizzi, Dino Mandrioli, Federica Panella, Matteo Pradella
2015 Science of Computer Programming  
To prove the practicality of a parallel lexing and parsing approach, we report the results of the adaptation of JSON and Lua to a form fit for parallel parsing (i.e. an operator-precedence grammar) through  ...  This in turn enables the construction of a scalable, data-parallel parsing algorithm, which is presented in this work.  ...  expressions without parentheses (a); its OPM (b) with the relations with # taken as implicit; and the derivation tree of string n + n × n (c).  ... 
doi:10.1016/j.scico.2015.09.002 fatcat:h5xzooyiizh3vkmc6pwvnl63u4

Prospects and limitations of full-text index structures in genome analysis

M. Vyverman, B. De Baets, V. Fack, P. Dawyndt
2012 Nucleic Acids Research  
Given the magnitude of sequence data to be processed, many bioinformatics tools rely on efficient solutions to a variety of complex string problems.  ...  These solutions include fast heuristic algorithms and advanced data structures, generally referred to as index structures.  ...  In addition, the authors would also like to thank the editor and the anonymous reviewers for their valuable comments and suggestions to improve the quality of the manuscript.  ... 
doi:10.1093/nar/gks408 pmid:22584621 pmcid:PMC3424560 fatcat:5sfziui7ujhfzcqhcukbi4utjq

A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes

Till Tantau
2016 Algorithms  
thus, be solved efficiently on tree-like graphs.  ...  It is thus somewhat surprising that algorithmic metatheorems can also be used 92 in contexts where the inputs are not tree-like graphs.  ...  solved efficiently on tree-like graphs.  ... 
doi:10.3390/a9030044 fatcat:4njcekeavbeufbltvu5y4rxkxa
« Previous Showing results 1 — 15 out of 4,752 results