default search action
Parallel Processing Letters, Volume 8, 1998
Volume 8, Number 1, March 1998
- Edward G. Coffman Jr., Shimon Even:
A Note on Limited Preemption. 3-6 - Shlomi Dolev:
Optimal Time Self-Stabilization in Uniform Dynamic Systems. 7-18 - Vincent Vajnovszki, Jean Marcel Pallo:
Parallel Algorithms for Listing Well-Formed Parentheses Strings. 19-28 - Padma Raghavan:
Efficient Parallel Sparse Triangular Solution Using Selective Inversion. 29-40 - Yung-Syau Chen, Jean-Luc Gaudiot:
Implementing Parallel Branch-and-Bound with Extended Sisal 2.0. 41-50 - Lionel Brunie, Harald Kosch, Wolfgang Wohner:
From the Modeling of Parallel Relational Query Processing to Query Optimization and Simulation. 51-62 - Julian Mattes, Denis Trystram, Jacques Demongeot:
Parallel Image Processing Using Neural Networks: Applications in Contrast Enhancement of Medical Images. 63-76 - Baback A. Izadi, Füsun Özgüner:
Optimal Subcube Allocation in a Circuit-Switched Faulty Hypercube. 77-81 - Amir Michail:
Optimal Broadcast and Summation on Hierarchical Ring Architectures. 83-94 - Loïc Prylli, Bernard Tourancheau:
Execution-Driven Simulation of Parallel Applications. 95-109 - S. Ramesh, Chandrashekar M. Shetty:
Impossibility of Synchronization in the Presence of Preemption. 111-120 - Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan:
Self-Stabilizing Algorithms for Tree Metrics. 121-133
Volume 8, Number 2, June 1998
- Arthur L. Liestman, Natasa Przulj:
Minimum Average Time Broadcast Graphs. 139-140 - Hovhannes A. Harutyunyan, Arthur L. Liestman:
Messy Broadcasting. 149-159 - Joseph G. Peters, Curtis C. Spencer:
Global Communication on Circuit-Switched Toroidal Meshes. 161-175 - Krzysztof Diks, Evangelos Kranakis, Andrzej Pelc:
Broadcasting in Unlabeled Tori. 177-188 - Satoshi Fujita, Stephane Perennes, Joseph G. Peters:
Neighbourhood Gossiping in Hypercubes. 189-195 - Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles. 197-205 - Tamar Eilam, Michele Flammini, Shmuel Zaks:
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load. 207-220 - Adele A. Rescigno, Ugo Vaccaro:
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks. 221-230 - Markus Röttger, Ulf-Peter Schroeder:
Embedding 2-Dimensional Grids into Optimal Hypercubes with Edge-Congestion 1 or 2. 231-242 - John A. Ellis, Minko Markov:
Embedding Grids into Grids: Dilation Four Suffices. 243-250 - David W. Krumme:
An Optimal Disjoint Pair of Additive Spanners for the 3D Grid. 251-258 - Thomas Andreae, Martin Hintz:
On Hypercubes in de Bruijn Graphs. 259-268
Volume 8, Number 3, September 1998
- Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Vaidyanathan:
Tighter and Broader Complexity Results for Reconfigurable Models. 271-282 - Yueming Li, Jianhui Tao, Si-Qing Zheng:
A Symmetric Processor Array with Synchronous Optical Buses and Switches. 283-295 - Tzung-Pei Hong, Jyh-Jong Lee:
A Nearly Optimal Back-Propagation Learning Algorithm on a Bus-Based Architecture. 297-306 - Jie Wu:
Fault-Tolerant Communications in Cube-Based Multiple-Bus Systems. 307-320 - Chunming Qiao, Yousong Mei:
An Improved Embedding of Binary Trees in a Square Reconfigurable Array with Spanning Optical Buses. 321-336 - Sook-Yeon Kim, Oh-Heum Kwon, Kyung-Yong Chwa:
Embeddings of Butterflies into Hypermeshes. 337-350 - M. Manzur Murshed, Richard P. Brent:
Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh. 351-361 - Tarun Anand, Phalguni Gupta:
A Selection Algorithm for X + Y on Mesh. 363-370 - Jean-Claude Bermond, Éric Darrot, Olivier Delmas, Stephane Perennes:
Hamilton Cycle Decomposition of the Butterfly Network. 371-385 - Marek Karpinski, Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. 387-397 - Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. 399-405 - Paraskevas Evripidou, Robert Barry:
Mapping Fortran Programs to Single Assignment Semantics for Efficient Parallelization. 407-418
Volume 8, Number 4, December 1998
- Michel Charpentier, Gérard Padiou:
Specification and Verification of the ATMR Protocol Using Unity. Part 1: Modeling and Specification of the Protocol. 421-432 - Michel Charpentier, Gérard Padiou:
Specification and Verification of the ATMR Protocol Using Unity. Part 2: Correctness Proof. 433-445 - Sergei Gorlatch, Holger Bischof:
A Generic MPI Implementation for a Data-Parallel Skeleton: Formal Derivation and Application to FFT. 447-458 - Teodor Rus, Eric Van Wyk:
Using Model Checking in a Parallelizing Compiler. 459-471 - Beverly A. Sanders, Berna L. Massingill, Svetlana Kryukova:
Derivation of an Algorithm for Location Management for Mobile Communication Devices. 473-488 - Andy Marsh:
A Novel Algorithm and Its Hardware Support for the Run-Time Detection of And-Parallelism. 489-501 - Mounir Hamdi, Chunming Qiao, Yi Pan:
On the Computing Power of Arrays of Processors with Optical Pipelined Buses. 503-513 - Thierry Lecroq, Jean Frédéric Myoupo, David Semé:
A One-Phase Parallel Algorithm for the Sequence Alignment Problem. 515-526 - Luca Trevisan, Fatos Xhafa:
The Parallel Complexity of Positive Linear Programming. 527-533 - Andy Marsh, Dimitra I. Kaklamani, Konstantinos Adam:
Using Parallel Processing as a Computational Tool to Solve Multi-Plate Electromagnetic Scattering Problems. 535-545 - John A. Ellis:
Addendum to "Embedding Grids into Grids: Dilation Four Suffices". Parallel Process. Lett. 8(4): 547 (1998) - Francesc Comellas, Gérard Gimenez:
Genetic Programming to Design Communication Algorithms for Parallel Architectures. 549-560 - Micha Hofri, David L. Thomson:
Matrix Transposition on a Mesh with Blocking Transmissions. 561-566 - Arthur M. Farley:
Optimally Routable Networks. 567-575 - Jong Hyuk Choi, Kyu Ho Park:
Segment Directory: An Improvement ot the Pointer in Directory Cache Coherence Schemes. 577-588 - Vicent Cholvi:
Specification of the Behavior of Memory Operations in Distributed Systems. 589-598
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.