Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Processing Letters, Volume 5, 1995
Volume 5, 1995
- Sartaj Sahni:
Data Manipulation on the Distributed Memory Bus Computer. 3-14
- Philip D. MacKenzie:
A Separation Between Reconfigurable Mesh Models. 15-22 - Koji Nakano:
Prefix-Sums Algorithms on Reconfigurable Meshes. 23-35 - Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
:
The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. 37-48 - Yosi Ben-Asher:
The Cartesian Product Problem and Implementing Production Systems on Reconfigurable Meshes. 49-61 - Torsten Suel:
Permutation Routing and Sorting on Meshes with Row and Column Buses. 63-80 - Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn:
Routing and Sorting on Reconfigurable Meshes. 81-95 - Cécile Germain, Franck Cappello:
The Static Network: A High Performance Reconfigurable Communication Network. 97-109 - Koji Nakano:
A Bibliography of Published Papers on Dynamically Reconfigurable Architectures. 111-124 - Louis Ibarra, Dana S. Richards:
Tree Open Ear Decomposition in Parallel Graph Algorithms. 129-138 - Torben Hagerup, Jörg Keller:
Fast Parallel Permutation Algorithms. 139-148 - Danny Krizanc, Lata Narayanan:
Zero-One Sorting on the Mesh. 149-155 - Frederic Desprez, Jack J. Dongarra, Bernard Tourancheau:
Performance Study of LU Factorization with Low Communication Overhead on Multiprocessors. 157-169 - Mohan Ahuja, Michel Raynal:
An Implementation of Global Flush Primitives Using Counters. 171-178 - Wentong Cai, David B. Skillicorn:
Calculating Recurrences Using the Bird-Meertens Formalism. 179-190 - Murray Cole:
Parallel Programming with List Homomorphisms. 191-203 - Sandy Pavel, Selim G. Akl:
Efficient Algorithms for the Euclidean Distance Transform. 205-212 - Ching-Tien Ho, Ming-Yang Kao:
Efficient Broadcast on Hypercubes with Wormhole and E-Cube Routings. 213-222 - Omer Berkman, Yossi Matias:
Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs. 223-230 - Sourav Bhattacharya, Shekhar H. Kirani, Wei-Tek Tsai:
Quadtree Layouts and I/O Bandwidth. 231-240 - Sotirios G. Ziavras:
Scalable Multifolded Hypercubes for versatile Parallel Computers. 241-250 - Rumen Andonov, Patrice Quinton, Sanjay V. Rajopadhye, Doran Wilde:
A Shift Registered-Based Systolic Array for the Unbounded Knapsack Problem. 251-262 - Mark A. Stalzer:
A Parallel Fast Multiple Method for the Helmholtz Equation. 263-274 - Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický:
On the Average Case Circuit Delay of Disjunction. 275-280 - Jerrell Watts, Robert A. van de Geijn:
A Pipelined Broadcast for Multidimensional Meshes. 281-292 - Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino:
Max Sat and Min Set Cover Approximation Algorithms are P-Complete. 293-298 - Rolf Niedermeier, Peter Rossmanith:
On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. 299-309 - David Raymond Lutz, Doddaballapur Narasimha-Murthy Jayasimha:
Do Fixed-Processor Communication-Time Tradeoffs Exist? 311-320 - Jie Wu:
Tight Bounds on the Number of l-Nodes in a Faulty Hypercube. 321-328 - Michael G. Norman, Susanna Pelagatti, Peter Thanisch:
On the Complexity of Scheduling with Communication Delay and Contention. 331-341 - Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan:
Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs. 343-355 - Gerard Tel:
Linear Election in Hypercubes. 357-366 - Kalyan S. Perumalla, Narsingh Deo:
Parallel Algorithms for Maximum Subsequence and Maximum Subarray. 367-373 - Ricardo C. Corrêa, Afonso Ferreira:
On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms. 375-386 - Anuj Chandra, Rami G. Melhem:
Reconfiguration in Fault-Tolerant 3D Meshes. 387-399 - Mark S. Merry, Johnnie W. Baker:
A Constant Time Sorting Algorithm for a Three Dimensional Reconfigurable Mesh and Reconfigurable Network. 401-412 - David J. Haglin:
Bipartite Expander Matching is in NC. 413-420 - Jean-Francois Collard, Tanguy Risset, Paul Feautrier:
Construction of Do Loops from Systems of Affine Constraints. 421-436 - Boleslaw K. Szymanski, William Maniatty, Balaram Sinharoy:
Simultaneous Parallel Reduction on SIMD Machines. 437-449 - I. W. Chan, F. Choi:
An Optimal Systolic Dictionary. 451-460 - Gabriel Oksa:
Time-Minimal Linear Systolic Arrays for the Toeplitz System of Linear Equations. 461-474 - Nathalie Drach, Alain Gefflaut, Philippe Joubert, André Seznec:
About Cache Associativity in Low-Cost Shared Memory Multi-Microprocessors. 475-487 - Andrzej Pelc:
Almost-Safe Byzantine Agreement in Sparse Networks with Random Faults. 489-497 - Chunming Qiao:
On Designing Communication-Intensive Algorithms for a Spanning Optical Bus Based Array. 499-511 - Marc Picquendar, Arnold L. Rosenberg, Vittorio Scarano:
A Cost-Effective Streamlining of the Diogenes Design Methodology. 513-524 - Michel Cosnard, Michel Loi:
Automatic Task Graph Generation Techniques. 527-538 - Qi Ning, Guang R. Gao:
Automatic Data and Computation Decomposition for Distributed-Memory Machines. 539-550 - Alain Darte, Frédéric Vivien:
Revisiting the Decomposition of Karp, Miller and Winograd. 551-562 - Vipul Gupta, Eugen Schenfeld:
Task Graph Partitioning and Mapping in a Reconfigurable Parallel Architecture. 563-574 - Ben Lee, Ali R. Hurson:
A Strategy for Scheduling Partially Ordered Program Graphs onto Multicomputers. 575-586 - Shankar Ramaswamy, Prithviraj Banerjee:
Simultaneous Allocation and Scheduling Using Convex Programming Techniques. 587-598 - Behrooz A. Shirazi, Hee Yong Youn, Daniel M. Lorts:
Evaluation of Static Scheduling Heuristics for Real-Time Multiprocessing. 599-610 - Richard Wolski:
Static Scheduling of Hierarchical Program Graphs. 611-622 - Yung-Kang Chu, Diane T. Rover:
An Effective Two-Dimensional Mesh Partitioning Strategy. 623-634 - Michael A. Palis, Jing-Chiou Liou, Sanguthevar Rajasekaran, Sunil M. Shende, David S. L. Wei:
Online Scheduling of Dynamic Trees. 635-646 - Jhy-Chun Wang, Tseng-Hui Lin, Sanjay Ranka:
Distributed Scheduling of Unstructured Collective Communication on the CM-5. 647-658 - Min-You Wu:
Parallel Incremental Scheduling. 659-670 - Frederic T. Chong, Shamik D. Sharma, Eric A. Brewer, Joel H. Saltz:
Multiprocessor Runtime Support for Fine-Grained, Irregular Dags. 671-683 - Bharat Kumar, Kalluri Eswar, P. Sadayappan, Chua-Huang Huang:
A Clustering Algorithm for Parallel Sparse Cholesky Factorization. 685-696
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 2023-10-03 00:01 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:
