Filters








22 Hits in 2.5 sec

Parallel Bridging Models and Their Impact on Algorithm Design [chapter]

Friedhelm Meyer auf der Heide, Rolf Wanka
2001 Lecture Notes in Computer Science  
We show how the critical blocksize can be taken into account by presenting a modified multisearch algorithm which is optimal in the BSP* model.  ...  The aim of this paper is to demonstrate the impact of features of parallel computation models on the design of efficient parallel algorithms.  ...  The effort on BSP, BSP*, and on designing and analyzing algorithms for them and on implementing the PUB Lib in Paderborn is the work of many individuals: Armin Bäumker, Olaf Bonorden, Wolfgang Dittrich  ... 
doi:10.1007/3-540-45718-6_68 fatcat:ancs2k7krjdxzojxtslmtfgnqe

Page 6620 of Mathematical Reviews Vol. , Issue 2001I [page]

2001 Mathematical Reviews  
Mahesh- wari [Anil Maheshwari], Blocking in parallel multisearch problems (145-189).  ...  (electronic) ); Giovanni Curi, Metric spaces in type theory via for- mal topology (extended abstract) (11 pp.  ... 

Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
1998 Theoretical Computer Science  
Intuitively, a l-optimal parallel algorithm for p processors achieves speed-up close to p. We consider the Multisearch Problem: Assume a strip in 2D to be partitioned into m segments.  ...  Previous parallel algorithms for Multisearch were far away from being l-optimal in our model and did not consider blockwise communication. Result 3.  ...  For this purpose the PRAM has proven to be a very convenient computation model, because it abstracts from communication problems.  ... 
doi:10.1016/s0304-3975(98)00020-6 fatcat:5yujyvlqibdb7kiqqznfukg4fi

Parallel triangle counting in massive streaming graphs

Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
Disciplines Abstract The number of triangles in a graph is a fundamental metric, used in social network analysis, link classification and recommendation, and more.  ...  This paper presents the design and implementation of a fast parallel algorithm for estimating the number of triangles in a massive undirected graph whose edges arrive as a stream.  ...  Acknowledgments Tangwongsan was in part sponsored by the U.S.  ... 
doi:10.1145/2505515.2505741 dblp:conf/cikm/TangwongsanPT13 fatcat:ic5ijt6g6vdjhjsmzhwxascihq

Towards Parallel Computing on the Internet: Applications, Architectures, Models and Programming Tools [article]

Elankovan Sundararajan, Aaron Harwood
2006 arXiv   pre-print
We also cover programming tools that are currently being used for parallel programming in computational grids.  ...  Effects of dynamism and uncertainties that arise in large scale systems are evidently important to understand and yet there is currently little work that addresses this from a parallel computing perspective  ...  This measure depends on several factors such as abstraction of the problem and the size of computation.  ... 
arXiv:cs/0612105v2 fatcat:cgttdbvuurbvbb2zjxqz6h5ehy

Chapter 5. Realistic Computer Models [chapter]

Deepak Ajwani, Henning Meyerhenke
2010 Lecture Notes in Computer Science  
D arbitrary blocks to be accessed in parallel.  ...  They extend C by a few parallel constructs to obtain the new programming language BSGP.  ... 
doi:10.1007/978-3-642-14866-8_5 fatcat:j326q2ymeffzfmo36nqst7msmq

Algorithm Engineering for Parallel Computation [chapter]

David A. Bader, Bernard M. E. Moret, Peter Sanders
2002 Lecture Notes in Computer Science  
As parallel computing becomes ubiquitous, we need to extend algorithm engineering techniques to parallel computation. Such an extension adds significant complications.  ...  After a short review of algorithm engineering achievements for sequential computing, we review the various complications caused by parallel computing, present some examples of successful efforts, and give  ...  Acknowledgments This work was supported in part by National Science Foundation grants CAREER ACI 00-93039 (  ... 
doi:10.1007/3-540-36383-1_1 fatcat:m6ayomzqk5flzkl2blp7x5cvji

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter
2001 ACM Computing Surveys  
The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however,  ...  We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory.  ...  Figures 6, 7, 9 , 10, 12, and 13 are modified versions of figures in Arge et al. [1998a] Enbody and Du [1998], Kanellakis et al. [1996] , Arge et al. [1999a,b], and Ferragina and Grossi [1999] , respectively  ... 
doi:10.1145/384192.384193 fatcat:tunz4fa3rrgv7hwbk7qsvahd5i

Algorithms and Data Structures for External Memory

Jeffrey Scott Vitter
2006 Foundations and Trends® in Theoretical Computer Science  
A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory.  ...  in order to reduce the I/O costs.  ...  Multisearch on parallel computers is considered in [141] .  ... 
doi:10.1561/0400000014 fatcat:bkfchugd4fbjvcu5zipnh23k6e

Parallel Computational Geometry: An Approach using Randomization [chapter]

John H. Reif, Sandeep Sen
2000 Handbook of Computational Geometry  
We describe very general methods for designing e cient parallel algorithms for problems in computational geometry.  ...  In addition, the algorithms on the Butter y network rely critically on an e cient randomized multisearching algorithm.  ...  The algorithms described in this chapter for 3-D convex hull and multisearching have been further extended by Goodrich 43 to the BSP model.  ... 
doi:10.1016/b978-044482537-7/50019-x fatcat:nsjg7tiv6jckxjqne63d3rnctu

Parallel computational optimization in operations research: A new integrative framework, literature review and research directions

Guido Schryen
2019 European Journal of Operational Research  
Solving optimization problems with parallel algorithms has a long tradition in OR.  ...  of what has been achieved and still needs to be done in parallel optimization in OR.  ...  GPU-based two level parallel B&B for the blocking job shop scheduling problem. Applied Soft Computing , 747-755. Agrawal, J., Mathew, T.V., 2004.  ... 
doi:10.1016/j.ejor.2019.11.033 fatcat:5olyajxlyrca7kmqscpgjef4vq

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

Mathematical Reviews  
A.; Maheshwari, Anil) Blocking in parallel multisearch problems. (English summary) 2001m:68031 Edelkamp, Stefan (with Wegener, Ingo) On the performance of WEAK-HEAPSORT.  ...  (see 2001d:68025) Alstrup, Stephen (with Ben-Amram, Amir M.; Rauhe, Theis) Worst-case and amortised optimality in union-find (extended abstract).  ... 

Parallel Branch-and-Bound Algorithms [chapter]

Teodor Gabriel Crainic, Bertrand Le Cun, Catherine Roucairol
Wiley Series on Parallel and Distributed Computing  
In most cases, base classes and default implementations are abstract.  ...  Several Load balancing strategies were proposed in order to ensure that each local pool has enough work. In the vast majority of these frameworks, there is no easy way to extend the parallel feature.  ... 
doi:10.1002/9780470053928.ch1 fatcat:7fg7r5rifrhbflvio76qid3u5a

Co-design of FPGA implementations for model predictive control

Bulat Khusainov, Eric Kerrigan, George Constantinides, European Union
2018
A procedure for formulating the MPC design problem as a multi-objective optimization problem is described.  ...  The necessity of solving an optimization problem at each sampling instant makes MPC a computationally demanding technique, especially when applied to fast dynamical systems.  ...  in parallel.  ... 
doi:10.25560/58953 fatcat:y4qfcsolqraohluskaq76zbbjy

Tagungsband: 30. Deutsche Arbeitsbesprechung über Fragen der Unkrautbiologie und -bekämpfung

:None, Bundesbehörden Und Einrichtungen Im Geschäftsbereich Des Bundesministeriums Für Ernährung Und Landwirtschaft (BMEL)
2022 Julius-Kühn-Archiv  
Hauptaufgabe des JKI ist die Beratung der Bundesregierung bzw. des BMEL in allen Fragen mit Bezug zur Kulturpflanze.  ...  Die vielfältigen Aufgaben sind in wichtigen rechtlichen Regelwerken, wie dem Pflanzenschutzgesetz, dem Gentechnikgesetz, dem Chemikaliengesetz und hierzu erlassenen Rechtsverordnungen, niedergelegt und  ...  Further information An extended trial report is available in German (TOTAL & SCHMID, 2020).  ... 
doi:10.5073/20220117-064519 fatcat:tfvikpwfzrdb3ob2a42vep6cza
« Previous Showing results 1 — 15 out of 22 results