default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. SPDP 1996: New Orleans, Louisiana, USA
- Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, SPDP 1996, New Orleans, Louisiana, USA, October 23-26, 1996. IEEE Computer Society 1996, ISBN 0-8186-7683-3
- Maciek Kormicki, Ausif Mahmood, Bradley S. Carlson:
Parallel logic simulation on a network of workstations using PVM. 2-9 - Minesh I. Patel, N. Ranganathan:
An intelligent system architecture for urban traffic control applications. 10-17 - Naveen Garg, Marina Papatriantafilou, Philippas Tsigas:
Distributed List Coloring: How To Dynamically Allocate Frequencies To Mobile Base Stations. 18-25 - Andrew Sohn, Rupak Biswas, Horst D. Simon
:
Impact Of Load Balancing On Unstructured Adaptive Grid Computations For Distributed-Memory Multiprocessors. 26-33 - Rajeev Sivaram, Dhabaleswar K. Panda, Craig B. Stunkel:
Efficient broadcast and multicast on multistage interconnection networks using multiport encoding. 36-45 - D. J. Chen, P. Y. Chang, Y. W. Lee:
An efficient file transmission algorithm for distributed computing systems. 48-51 - Gianluigi Alari, Ajoy Kumar Datta:
Almost two-state self-stabilizing algorithm for token rings. 52-59 - Alexander Forst, Eva Kühn:
Implementing cooperative software with high-level communication packages. 60-67 - Niki Pissinou, Kanonkluk Vanapipat, Kia Makki, B. K. Rajashekhar, Eun Kyo Park, B. Wong, Xiaohua Jia:
A framework for modeling applications as distributed active objects. 68-72 - Young Won Lim, Prashanth B. Bhat, Viktor K. Prasanna:
Efficient algorithms for block-cyclic redistribution of arrays. 74-83 - Sekhar Darbha, Dharma P. Agrawal:
Scalable scheduling algorithm for distributed memory machines. 84-91 - Jordi Garcia, Eduard Ayguadé, Jesús Labarta:
A framework for automatic dynamic data mapping. 92-99 - Samir Ayachi, Sivarama P. Dandamudi:
A hierarchical processor scheduling policy for multiprocessor systems. 100-109 - Péter Kacsuk, Makoto Amamiya:
Prolog on the multithreaded Datarol-II machine based on the logicflow execution model. 112-121 - Murali Annavaram, Walid A. Najjar:
Comparison of two storage models in data-driven multithreaded architectures. 122-129 - Lizy K. John, Ramesh Radhakrishnan:
Improving the parallelism and concurrency in decoupled architectures. 130-137 - Zina Ben-Miled, José A. B. Fortes:
A heterogeneous hierarchical solution to cost-efficient high performance computing. 138-145 - Ding-Ming Kwai, Behrooz Parhami:
Periodically regular chordal rings: generality, scalability, and VLSI layout. 148-151 - Shahram Latifi, Pradip K. Srimani:
A new fixed degree regular network for parallel processing. 152-159 - Marc Baumslag, Bojana Obrenic:
Index-shuffle graphs. 160-168 - Vijay Kumar, Eric J. Schwabe:
Improved algorithms and data structures for solving graph problems in external memory. 169-176 - San-Yuan Wang, Yu-Chee Tseng, Chin-Wen Ho:
Efficient single-node broadcast in wormhole-routed multicomputers: a network-partitioning approach. 178-185 - Manuel P. Malumbres, José Duato, Josep Torrellas:
An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors. 186-189 - Doddaballapur Narasimha-Murthy Jayasimha, D. Manivannan, Jeff A. May, Loren Schwiebert, Stephen L. Hary:
A foundation for designing deadlock-free routing algorithms in wormhole networks. 190-197 - Prasant Mohapatra, Vara Varavithya:
A hardware multicast routing algorithm for two-dimensional meshes. 198-205 - Ky McPherson, Prithviraj Banerjee:
Integrating task and data parallelism in an irregular application: a case study. 208-213 - Emily Angerer Crawford, Karsten Schwan, Sudhakar Yalamanchili:
Optimistic parallel computation: an example from computational chemistry. 214-217 - Sorin G. Nastea, Ophir Frieder, Tarek A. El-Ghazawi:
Load-balancing in sparse matrix-vector multiplication. 218-225 - José Salinas, Robert Bernecky:
Real-time sonar beamforming on a MasPar architecture. 226-229 - James E. Beck, Daniel P. Siewiorek:
Simulated annealing applied to multicomputer task allocation and processor specification. 232-239 - Joford T. Lim, Ali R. Hurson, Krishna M. Kavi, Ben Lee:
A loop allocation policy for DOACROSS loops. 240-249 - Canming Jin, Yong Yan, Xiaodong Zhang:
An adaptive loop scheduling algorithm on shared-memory systems. 250-257 - Min-You Wu:
An efficient parallel scheduling algorithm. 258-261 - S. Olarin, Si-Qing Zheng:
Sorting N items using a p-sorter in optimal time. 264-272 - Taoufik Dachraoui, Lata Narayanan:
Fast deterministic sorting on large parallel machines. 273-280 - Hong Shen:
Generalized parallel selection in sorted matrices. 281-285 - Mark W. Goudreau, Eric D. Root:
A bulk-synchronous parallel library implementation for the BBN butterfly GP1000. 288-297 - Toshihiro Hanawa, Takashi Fujiwara, Hideharu Amano:
Hot spot contention and message combining in the simple serial synchronized multistage interconnection network. 298-305 - Raymond Hoare, Henry G. Dietz, Timothy Mattox, Soohong P. Kim:
Bitwise aggregate networks. 306-313 - Philip Bohannon, Daniel F. Lieuwen, Abraham Silberschatz:
Recovering scalable spin locks. 314-322 - J. E. Thomas, S. J. Schwarz, Walter A. Burkhard:
Almost complete address translation (ACATS) disk array declustering. 324-331 - Chitra Natarajan, Ravishankar K. Iyer:
Measurement and simulation based performance analysis of parallel I/O in a high-performance cluster system. 332-339 - Jang Sun Lee, Jungmin Kim, P. Bruce Berra, Sanjay Ranka:
Logical disks: user-controllable I/O for scientific applications. 340-347 - Prasant Mohapatra, ByungJun Ahn, Jian-Feng Shi:
On-line real-time task scheduling on partitionable multiprocessors. 350-357 - Sarantos Kapidakis, Marios Mavronicolas:
Distributed, low contention task allocation. 358-365 - Min-You Wu, Wei Shu:
The direct dimension exchange method for load balancing in k-ary n-cubes. 366-369 - Bharat S. Joshi, Seyed H. Hosseini, K. Vairavan:
A load balancing algorithm for bus-oriented systems. 370-374 - Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh, Terence R. Smith:
Parallelizing multidimensional index structures. 376-383 - Sajal K. Das, Marie-Anne Demuynck:
Bmad-tree: an efficient data structure for parallel processing. 384-391 - Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson:
A unifying methodology for multiple querying on enhanced meshes. 392-399 - Darrell D. E. Long, Jehan-François Pâris:
A leaner, more efficient, available copy protocol. 400-407 - Hany H. Ammar, Zhouhui Miao:
Performance of parallel algorithms for a fingerprint image comparison system. 410-413 - Asish Law, Roni Yagel:
The active-ray approach to rendering on distributed memory multiprocessors. 414-421 - Wanqing Wu, Madalene Spezialetti, Rajiv Gupta:
Guaranteed intrusion removal from monitored distributed applications. 422-425 - Mark G. Brockington, Jonathan Schaeffer:
The APHID parallel αβ search algorithm. 428-432 - Si-Qing Zheng, Jie Wu:
Dual of a complete graph as an interconnection network. 433-442 - Marcelo M. de Azevedo, Nader Bagherzadeh, Martin Dowd, Shahram Latifi:
Average distance and routing algorithms in the star-connected cycles interconnection network. 443-452 - Chi-Hsiang Yeh, Behrooz Parhami:
Recursive hierarchical swapped networks: versatile interconnection architectures for highly parallel systems. 453-460 - Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend:
Integrating list heuristics into genetic algorithms for multiprocessor scheduling. 462-469 - Dawn E. Gregory, Lixin Gao, Arnold L. Rosenberg, Paul R. Cohen:
An empirical study of dynamic scheduling on rings of processors. 470-473 - Thomas Rauber, Gudula Rünger:
Scheduling of multiprocessor tasks for numerical applications. 474-481 - Y. Kopidakis, Didier Fayard, Vassilis Zissimopoulos:
Linear time approximation schemes for parallel processor scheduling. 482-485 - Sanjay Goil, Srinivas Aluru, Sanjay Ranka:
Concatenated parallelism: a technique for efficient parallel divide and conquer. 488-495 - Ömer Egecioglu, Maximilian Ibel:
Parallel algorithms for fast computation of normalized edit distances. 496-503 - Eunice E. Santos:
Optimal and efficient parallel algorithms for summing and prefix summing. 504-511 - B. Ravikumar:
A deterministic parallel algorithm for the homing sequence problem. 512-520 - Srinivasan Parthasarathy, Wei Li, Michal Cierniak, Mohammed Javeed Zaki:
Compile-time inter-query dependence analysis. 522-529 - Mayez Al-Mouhamed, Lubomir Bic, Husam Abu-Haimed:
A compiler address transformation for conflict-free access of memories and networks. 530-537 - Gopal Gupta, Enrico Pontelli:
Last alternative optimization. 538-541 - Yung-Syau Chen, Jean-Luc Gaudiot:
Extending functional languages with stateful computations. 542-549 - Mario Blaum, Jehoshua Bruck, Gustavo D. Pifarré, Jorge L. C. Sanz:
On optimal placements of processors in tori networks. 552-555 - Yuyun Liao, Mi Lu, Nian-Feng Tzeng:
The Palindrome network for fault-tolerant interconnection. 556-561 - Bülent Yener:
Virtual embeddings on regular topology networks. 562-565 - Samia Loucif, Lewis M. Mackenzie, Mohamed Ould-Khaoua:
The "express channel" concept in hypermeshes and k-ary n-cubes. 566-569 - Nitin H. Vaidya:
On Staggered Checkpointing. 572-580 - Gustavo Alonso, Divyakant Agrawal, Amr El Abbadi:
Process Synchronization In Workflow Management Systems. 581-588 - Michel Hurfin, Masaaki Mizuno, Michel Raynal, Mukesh Singhal:
On-The-Fly Detection Of Conjunctions Of Local Predicates In Distributed Computations. 589-592 - Jeremy Carroll, Andrei Borshchev:
A deterministic model of time for distributed systems. 593-598 - Jan Trdlicka, Pavel Tvrdík:
Embedding of k-ary complete trees into hypercubes with optimal load. 600-607 - Nina Saxena, Sudeep Sarkar, N. Ranganathan:
Mapping and parallel implementation of Bayesian belief networks. 608-611
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 2025-05-17 00:11 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:
