Filters








189,483 Hits in 7.7 sec

Computational bounds for fundamental problems on general-purpose parallel models

Philip D. MacKenzie, Vijaya Ramachandran
1998 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98  
We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models qsm and s-qsm, and the distributed-memory model, the bsp  ...  For each of these models, we also obtain lower bounds for the number of rounds needed to solve these problems using a randomized algorithm on a p-processor machine.  ...  Introduction Recently, there has been a great deal of interest in developing general-purpose models of parallel computation that incorporate features of real machines such as bandwidth limitations and  ... 
doi:10.1145/277651.277681 dblp:conf/spaa/MackenzieR98 fatcat:zf2bjy3dajexnbymse7234i6c4

Page 5373 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
McColl, General purpose parallel computing (337-391); An- drew Chin, Complexity models for all-purpose parallel computa- tion (393-404); Harry A. G.  ...  For these models of computations some general issues (not related to algorithms for particular prob- lems) are discussed.  ... 

Page 282 of Mathematical Reviews Vol. , Issue 81A [page]

1981 Mathematical Reviews  
computation of any sort, the technique developed for establishing lower bounds is applicable to problems of sorting networks and related parallel computations.”  ...  Time and parallel processor bounds for Fortran-like loops. IEEE Trans. Comput. 28 (1979), no. 9, 660-670.  ... 

Structural parallel algorithmics [chapter]

Uzi Vishkin
1991 Lecture Notes in Computer Science  
The following informal statement represents my belief on the future of general-purpose parallel computation: Unless parallel machines are designed to support the PRAM, or a model of parallel computation  ...  Research on lower bounds for parallel computation indicates that this goal is unachievable for almost any interesting problem.  ... 
doi:10.1007/3-540-54233-7_148 fatcat:7itpvjsg7ngmbdh4aj6xpxe2he

Page 1644 of Mathematical Reviews Vol. , Issue 94c [page]

1994 Mathematical Reviews  
It is a general-purpose enumerative technique for solving a wide range of problems in combinatorial optimisation, operations research and artificial intelligence.  ...  Branch-and-bound appears to be well suited for parallel processing because packets of work which could be exe- cuted independently on different processors are generated during a branch-and-bound algorithm  ... 

Page 7812 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
97m:68088 parallel branch-and-bound (379-393); Ricardo Corréa, A parallel formulation for general branch-and-bound algorithms (395-409). 97m:68088 68Q25 16P10 65Y20 68Q40 Alekseev, V. B.  ...  Comput. 26 (1997), no. 1, 210-230. Summary: “Constructing evolutionary trees for species sets is a fundamental problem in biology.  ... 

Page 4201 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
Here we survey efficient parallel algorithms for many fundamental computational problems on finite automata.  ...  “The purpose of this chapter is first to introduce the most Algorithms For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet 2001f:68137 successful models of parallel computation  ... 

Trade-offs between Communication Throughput and Parallel Time

Yishay Mansour, Noam Nisan, Uzi Vishkin
1999 Journal of Complexity  
will be severly handicapped as general purpose parallel machines.  ...  ., small m) could have significant effect on parallel computation. We show an almost matching upper bound of O((nÂ-mp) log O(1) n).  ...  algorithms on low-CT systems. (3) Parallel computers with a low-CT level will be handicapped as general purpose computing systems.  ... 
doi:10.1006/jcom.1998.0498 fatcat:yp4ddm66yrgrfopymotdzto344

Unbounded hardware is equivalent to deterministic turing machines

Bernard Chazelle, Louis Monier
1983 Theoretical Computer Science  
With this formal apparatus, we define a very general, realistic model of planar, digital circuits, which allows for full parallelism.  ...  The purpose of this paper is to investigate models of computation from a realistic , viewpoint.  ...  Parallel vs. sequential models The general model of physical computation which we will consider has been described in previous work (Chazeiie and Monier [5] ).  ... 
doi:10.1016/0304-3975(83)90044-0 fatcat:om7ky4iepjhvlhe266ekmobzzm

Page 468 of Mathematical Reviews Vol. , Issue 96a [page]

1996 Mathematical Reviews  
Summary: “We introduce a linear algebraic model of computa- tion, the span program, and prove several upper and lower bounds on it.  ...  We show that computing the resulting small dominating set is P-hard and so cannot be done efficiently in parallel (in the context of the PRAM model of parallel com- putation).  ... 

TASKWORK: A Cloud-aware Runtime System for Elastic Task-parallel HPC Applications

Stefan Kehrer, Wolfgang Blochinger
2019 Proceedings of the 9th International Conference on Cloud Computing and Services Science  
For evaluation purposes, we discuss a development framework for parallel branch-and-bound based on TASKWORK, show how to implement an elastic HPC application, and report on measurements with respect to  ...  In this paper, we discuss how to address these challenges for HPC applications with dynamic task parallelism and present TASKWORK, a cloud-aware runtime system based on our findings.  ...  ACKNOWLEDGEMENTS This research was partially funded by the Ministry of Science of Baden-Württemberg, Germany, for the Doctoral Program Services Computing.  ... 
doi:10.5220/0007795501980209 dblp:conf/closer/KehrerB19 fatcat:dfzodocvg5am3exjamu2wi7tii

Page 4941 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews  
Summary: “In this paper, we present efficient parallel algorithms for solving several fundamental problems on planar st-graphs.  ...  Comput. Sci. 203 (1998), no. 2, 175-203. Summary: “In this paper we design and analyse parallel algorithms with the goal of obtaining exact bounds on their speed-ups on real machines.  ... 

Reducing Thread Divergence in GPU-Based B&B Applied to the Flow-Shop Problem [chapter]

Imen Chakroun, Ahcène Bendjoudi, Nouredine Melab
2012 Lecture Notes in Computer Science  
We focus on the parallel evaluation of the bounds for the Flow-shop scheduling problem.  ...  Experiments reported that parallel evaluation of bounds speeds up execution up to 54.5 times compared to a CPU version.  ...  We focused on the parallel evaluation of the bounds for the Flow-shop permutation problem.  ... 
doi:10.1007/978-3-642-31464-3_57 fatcat:vsfwbqqafrho7cbo4zhopfydo4

Performance Estimation for Scheduling on Shared Networks [chapter]

Jaspal Subhlok, Shreenivasa Venkataramaiah
2003 Lecture Notes in Computer Science  
This paper develops a framework to model the performance of parallel applications executing in a shared network computing environment.  ...  For sharing of a single computation node or network link, the actual performance is predicted, while for sharing of multiple nodes and links, performance bounds are developed.  ...  We wish to thank other current and former members of our research group, in particular, Mala Ghanesh, Amitoj Singh, and Sukhdeep Sodhi, for their contributions.  ... 
doi:10.1007/10968987_8 fatcat:xrs5z3adnbhkhicbmybw4dodma

MATLAB Simulink modeling and simulation of LVI-based primal–dual neural network for solving linear and quadratic programs

Yunong Zhang, Weimu Ma, Xiao-Dong Li, Hong-Zhou Tan, Ke Chen
2009 Neurocomputing  
Recently, a primal-dual neural network based on linear variational inequalities (LVI) was developed by Zhang et al. for the online solution of linear-programming (LP) and quadratic-programming (QP) problems  ...  For the final purpose of field programmable gate array (FPGA) and application-specific integrated circuit (ASIC) realization, we investigate in this paper the MATLAB Simulink modeling and simulative verification  ...  The dynamic-system approach is one of the most important parallel computational methods for solving online optimization problems and related issues [2, 7, 10, 13, 20, 21] .  ... 
doi:10.1016/j.neucom.2008.07.008 fatcat:rff25okeavhmta6jb4rguaavia
« Previous Showing results 1 — 15 out of 189,483 results