Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. IRREGULAR 1995: Lyon, France
- Afonso Ferreira, José D. P. Rolim:
Parallel Algorithms for Irregularly Structured Problems, Second International Workshop, IRREGULAR '95, Lyon, France, September 4-6, 1995, Proceedings. Lecture Notes in Computer Science 980, Springer 1995, ISBN 3-540-60321-2
Programming Methods & Compiling Techniques
- Thierry Gautier, Jean-Louis Roch, Gilles Villard:
Regular versus Irregular Problems and Algorithms. 1-25 - George Horatiu Botorog, Herbert Kuchen:
Algorithmic Skeletons for Adaptive Multigrid Methods. 27-41 - Manuel Ujaldon, Shamik D. Sharma, Joel H. Saltz, Emilio L. Zapata:
Run-Time Techniques for Parallelizing Sparse Matrix Problems. 43-57 - Vincenzo Auletta, Alberto Negro, Vittorio Scarano
:
Fast Execution of Irregularly Structured Programs with Low Communication Frequency on the Hypercube. 59-73 - V. Prasad Krothapalli, Thulasiraman Jeyaraman, Mark Giesbrecht:
Run-Time Parallelization of Irregular DOACROSS Loops. 75-80
Mapping & Scheduling
- Benjamin Hao, David Pearson:
Instruction Scheduling and Global Register Allocation for SIMD Multiprocessors. 81-86 - Sathiamoorthy Manoharan:
General Bounds for the Assignment of Irregular Dependency Graphs. 87-98 - Ranjan K. Sen:
a New Scheme for Dynamic Processor Assignment for Irregular Problems. 99-113 - Cevdet Aykanat, Ismail Haritaoglu:
An Efficient Mean Field Annealing Formulation for Mapping Unstructured Domains to Hypercubes. 115-120 - Chris Walshaw, Mark Cross, Martin G. Everett, Steve P. Johnson, Kevin McManus:
Partitioning & Mapping of Unstructured Meshes to Parallel Machine Topologies. 121-126 - Cong Fu, Tao Yang, Apostolos Gerasoulis:
Integrating Software Pipelining and Graph Scheduling for Iterative Scientific Computations. 127-141 - Klaus Jansen, Sabine R. Öhring:
Approximation Algorithms for Time Constrained Scheduling. 143-157 - Cristina Boeres, George Chochia, Peter Thanisch:
On the Scope of Applicability of the ETF Algorithm. 159-164 - Felipe M. G. França, Luérbio Faria:
Optimal Mapping of Neighbourhood-Constrained Systems. 165-170
Applications
- Charles R. Cantor, Takeshi Sano, Natalia E. Broude, Cassandra L. Smith:
Parallel Processing in DNA Analysis. 171-185 - Philip W. Grant, Michael F. Webster, Xiaoming Zhang:
Solving Computational Fluid Dynamics Problems on Unstructured Grids with Distributed Parallel Processing. 187-197 - Ralf Diekmann, Derk Meyer, Burkhard Monien:
Parallel Decomposition of Unstructured FEM-Meshes. 199-215 - Miguel Ángel García:
Massively Parallel Approximation of Irregular Triangular Meshes with G¹ Parametric Surfaces. 217-230 - Till Bubeck, M. Hiller, Wolfgang Küchlin, Wolfgang Rosenstiel:
Distributed Symbolic Computation with DTS. 231-248 - Amitabha Das, Louise E. Moser, P. M. Melliar-Smith:
A Parallel Processing Paradigm for Irregular Applications. 249-254 - Serge Miguet, Jean-Marc Pierson:
Load Balancing Strategies for a Parallel System of Particles. 255-260 - Abdelhamid Benaini, David Laiymani, Guy-René Perrin:
A Reconfigurable Parallel algorithm for Sparse Cholesky Factorization. 261-274 - Andreas Uhl:
Adapted Wavelet Analysis on Moderate Parallel Distributed Memory MIMD Architectures. 275-283 - Stefan Tschöke, Norbert Holthöfer:
A New Parallel Approach to the Constrained Two-Dimensional Cutting Stock Problem. 285-300 - Wilhelm Hasselbring, Robert B. Fisher:
Using the ProSet-Linda Prototyping Language for Investigating MIMD Algorithms for Model Matching in 3-D Computer Vision. 301-315
Optimization
- Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende:
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. 317-331 - Peter Sanders:
Better Algorithms for Parallel Backtracking. 333-347 - Holger Hopp, Peter Sanders:
Parallel Game Tree Search on SIMD Machines. 349-361 - Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens:
Asynchronous Parallel Branch and Bound and Anomalies. 363-377 - Peter Sanders:
Fast Priority Queues for Parallel Branch-and-Bound. 379-393 - Ricardo C. Corrêa:
A Parallel Formulatiion for General Branch-and-Bound Algorithms. 395-409
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-17 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
