Filters








102 Hits in 4.8 sec

Page 4531 of Mathematical Reviews Vol. , Issue 91H [page]

1991 Mathematical Reviews  
and parallel integer sorting.  ...  Summary: “We consider the problem of deterministic integer sort- ing On unit-cost sequential and parallel machines with a large word length and show that n integers drawn from {0,---,m—1} can be sorted  ... 

Improved Fast Integer Sorting in Linear Space

Yijie Han
2001 Information and Computation  
As a consequence our technique can be extended to apply to nonconservative sorting and parallel sorting.  ...  Our EREW parallel algorithm sorts n integers in {0, 1, . . . , m − 1} in O((log n) 2 ) time and O(n(log log n) 2 / log log log n) operations provided log m = ((log n) 2 ). C  ...  Continuous research efforts have been made by many researchers on the sequential and parallel integer sorting (Albers and Hagerup 1997; Andersson 1996; Andersson et al. 1995; Bhatt et al. 1991; Dessmark  ... 
doi:10.1006/inco.2001.3053 fatcat:une6vw3ur5hadlcirwzegr242y

Improved Parallel Integer Sorting without Concurrent Writing

Susanne Albers, Torben Hagerup
1997 Information and Computation  
improving the upper bound on the word length necessary to sort integers with a linear time processor product, even sequentially.  ...  We show that n integers in the range 1, ..., n can be sorted stably on an EREW PRAM using O(t) time and O(n(-log n log log n+(log n) 2 Ât)) operations, for arbitrary given t log n log log n, and on a CREW  ...  ACKNOWLEDGMENTS We are grateful to Christine Ru b and Richard Anderson, whose suggestions allowed us to improve our results and to simplify the exposition.  ... 
doi:10.1006/inco.1997.2632 fatcat:lfxceubgffazhdbhgthfd5rxim

More Efficient Parallel Integer Sorting [chapter]

Yijie Han, Xin He
2012 Lecture Notes in Computer Science  
This algorithm sorts n integers in {0, 1, 2, ..., n 1/2 } in O((log n) 3/2 / log log n) time and O(n(log n/ log log n) 1/2 ) operations.  ...  It also sorts n integers in {0, 1, 2, ..., n − 1} in O((log n) 3/2 / log log n) time and O(n(log n/ log log n) 1/2 log log log n) operations.  ...  To our experience significant improvement over Han and Shen's work [13] on the operation complexity for parallel integer sorting is very difficult.  ... 
doi:10.1007/978-3-642-29700-7_26 fatcat:hh27ugs3lfh25h4flns7oxeotu

Sorting in Linear Time?

Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1998 Journal of computer and system sciences (Print)  
Our deterministic and randomized sequential and parallel algorithms generalize to the lexicographic sorting problem of sorting multiple-precision integers represented in several words.  ...  We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O. . 2W -1 in O (n log log n) time, for arbitrary w z log n, a significant improvement over the bound of O (n-  ...  This is only possible, of course, if several integers to be sorted fit in one word, i.e., packed sorting is inherently nonconservative.  ... 
doi:10.1006/jcss.1998.1580 fatcat:czaka6rbejgdtgzcunuyfix42i

Sorting in linear time?

Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1995 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95  
Our deterministic and randomized sequential and parallel algorithms generalize to the lexicographic sorting problem of sorting multiple-precision integers represented in several words.  ...  We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O. . 2W -1 in O (n log log n) time, for arbitrary w z log n, a significant improvement over the bound of O (n-  ...  This is only possible, of course, if several integers to be sorted fit in one word, i.e., packed sorting is inherently nonconservative.  ... 
doi:10.1145/225058.225173 dblp:conf/stoc/AnderssonHNR95 fatcat:5pl4yf3zi5fq7j5omkeki7kmbi

An algebraic model for divide-and-conquer and its parallelism

Zhijing G. Mou, Paul Hudak
1988 Journal of Supercomputing  
Algorithms developed under the model contain vast amounts of parallelism and can be mapped fairly easily to parallel computers. 9 What are the structural and domain properties of "'divide" and "combine  ...  The model reveals the internal structure of divide-and-conquer functions, leads to high-level and functional-styled algorithms specification, and simplifies complexity analysis.  ...  Acknowledgments We thank Steve Anderson for many helpful discussions, and Alan Perlis for his comments on the earlier versions of this paper.  ... 
doi:10.1007/bf00129780 fatcat:nrjs7y5wlfbj3ljx7xphcanvra

The transactional memory / garbage collection analogy

Dan Grossman
2007 SIGPLAN notices  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The connections are fascinating in their own right, and they let us better understand one technology by thinking about the corresponding issues for the other.  ...  Acknowledgments Conversations with Emery Berger, Jim Larus, Jan Vitek, members of the WASP group at the University of Washington, and many others led to some of the ideas presented here.  ... 
doi:10.1145/1297105.1297080 fatcat:mcgkbnpue5gzjav52fvier6qqm

The transactional memory / garbage collection analogy

Dan Grossman
2007 Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The connections are fascinating in their own right, and they let us better understand one technology by thinking about the corresponding issues for the other.  ...  Acknowledgments Conversations with Emery Berger, Jim Larus, Jan Vitek, members of the WASP group at the University of Washington, and many others led to some of the ideas presented here.  ... 
doi:10.1145/1297027.1297080 dblp:conf/oopsla/Grossman07 fatcat:lev6ytg45zchzabv3pprp2xxga

Scaling Performance via Self-Tuning Approximation for Graphics Engines

Mehrzad Samadi, Janghaeng Lee, D. Anoushe Jamshidi, Scott Mahlke, Amir Hormati
2014 ACM Transactions on Computer Systems  
For particular domains, such as multimedia and learning algorithms, approximation is commonly used today.  ...  Our target platform is the GPU because of its high performance capabilities and difficult programming challenges that can be alleviated with proper automation.  ...  Atomic operations are widely used in parallel sorting and reduction operations [NVIDIA 2013 ] so that many different threads can update the same memory address in parallel code, as seen in the NVIDIA  ... 
doi:10.1145/2631913 fatcat:5f5slfsfvjgrbnlcq5ql3fsvju

Page 1211 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
sorting on the EREW PRAM. 91c:68012 — (with Shen, Hong”) Improved nonconservative sequential and parallel integer sorting. 91h:68025 Han, Yijie (with Igarashi, Yoshihide) Time lower bounds for sorting  ...  Efficient deterministic parallel algorithms for integer sorting. (see 91m:68002) Chiebus, Bogdan S.  ... 

Composite programs: hierarchical construction, circularity, and deadlocks

W.A. Muhanna
1991 IEEE Transactions on Software Engineering  
The model is then used to derive necessary and sufficient conditions for a deadlock to arise in a cycle; and 3) describes techniques for dealing with a special class of deadly cycles, once identified.  ...  nonprocedural, development environment where new composite programs are constructed by coupling a collection of existing component programs, each of whose interface is defined by a fixed number of input ports and  ...  A concurrent program is composed of two or more sequential programs that may be executed concurrently as parallel processes cooperating to achieve a common goal [2] .  ... 
doi:10.1109/32.90432 fatcat:23gurhnohrarbdu6i5bnr322fy

Lost in optimisation of water distribution systems? A literature review of system operation

Helena Mala-Jetmarova, Nargiz Sultanova, Dragan Savic
2017 Environmental Modelling & Software  
Those models were improved by the incorporation of control valves to direct disinfectant laden-water where required (Kang and Lansey 2009; Kang and Lansey 2010) and by inclusion of uncertainties on demands  ...  Optimisation methods used were mainly LP and mixed integer nonlinear programming (MINLP) (for example Arai et al. (2013), Biscos et al. (2003), Boccelli et al. (1998)) and metaheuristic algorithms (GA  ...  The parallel computing model found the same solutions in less than 50% of execution time compared to the sequential model.  ... 
doi:10.1016/j.envsoft.2017.02.009 fatcat:ryp5kbzafrb43lprrx5ptzzvme

Computational modeling for multiphase flows with spacecraft application

Eray Uzgoren, Rajkeshar Singh, Jaeheon Sim, Wei Shyy
2007 Progress in Aerospace Sciences  
(2D/3D) Cartesian grids, and multi-level domain decomposition method that utilizes Hilbert space filling curves for parallel processing strategy.  ...  to handle complex interface behavior, and bubble/droplet placed in a vortex field with various density/viscosity ratios across interfaces to address load balancing and scalability aspects of parallel  ...  This allows us to use a sorting algorithm instead of a walk through the cells. A quick sort algorithm, which has N log N operations, is used to finalize the cell ordering.  ... 
doi:10.1016/j.paerosci.2007.06.003 fatcat:6oevzzcuzrcahajh4cdopldybi

Page 457 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
Improved nonconservative sequential and parallel integer sorting. Inform. Process. Lett. % (1990), no. 2, 57-63. (Summary) 91h:68025 68P10 — Planar depth-first search in O(log n) parallel time.  ...  (Summary) 91a:68055 68Q05 (68Q15) — (with Rib, Christine) Optimal merging and sorting on the EREW PRAM. Inform. Process. Lett. 33 (1989), no. 4, 181-185.  ... 
« Previous Showing results 1 — 15 out of 102 results