default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. SPDP 1994: Dallas, Texas, USA
- Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, SPDP 1994, Dallas, Texas, USA , October 26-29, 1994. IEEE Computer Society 1994, ISBN 0-8186-6427-4
- Ralf Diekmann, Jörn Gehring, Reinhard Lüling, Burkhard Monien, Markus Nubel, Rolf Wanka:
Sorting large data sets on a massively parallel system. 2-9 - Amitabh Dave, Nayeem Islam, Roy H. Campbell:
A low-latency scalable locking algorithm for shared memory multiprocessors. 10-17 - Supriya Madhuram, Anup Kumar:
A hybrid approach for mutual exclusion in distributed computing systems. 18-25 - Shyh-Chang Lin, William F. Punch III, Erik D. Goodman:
Coarse-grain parallel genetic algorithms: categorization and new approach. 28-37 - Ravi Varadarajan, Injae Hwang:
An efficient dynamic processor allocation algorithm for adaptive mesh applications. 38-45 - Davender Babbar, Phillip Krueger:
A performance comparison of processor allocation and job scheduling algorithms for mesh-connected multiprocessors. 46-53 - Ricardo Bianchini, Mark Crovella, Leonidas I. Kontothanassis, Thomas J. LeBlanc:
Software interleaving. 56-65 - Guohui Yu, Lonnie R. Welch:
Program dependence analysis for concurrency exploitation in programs composed of abstract data type modules. 66-73 - Swamy Punyamurtula, Vipin Chaudhary:
Minimum dependence distance tiling of nested loops with non-uniform dependences. 74-81 - Garng M. Huang, Weerakorn Ongsakul:
An adaptive SOR algorithm and its parallel implementation for power system applications. 84-91 - William I. Baker, Ausif Mahmood:
An analysis of parallel synchronous and conservative asynchronous logic simulation schemes. 92-99 - Andrew Sohn, Mitsuhisa Sato, Shuichi Sakai, Yuetsu Kodama, Yoshinori Yamaguchi:
Parallel bidirectional heuristic search on the EM-4 multiprocessor. 100-107 - Vibby Gottemukkala, Edward Omiecinski, Umakishore Ramachandran:
A scalable sharing architecture for a parallel database system. 110-117 - Rong Lin, Stephan Olariu:
Application-specific array processors for binary prefix sum computation. 118-125 - Anna M. del Corral, José M. Llabería:
Out-of-order access to vector elements in order to reduce conflicts in vector processors. 126-134 - Xiaodong Zhang, Hong Deng:
Distributed image edge detection methods and performance. 136-143 - Jeffrey J. P. Tsai, Bing Li:
Improving parallel execution performance for logic programs using mode information. 144-151 - Ben Lee:
An analysis of data distribution methods for Gaussian elimination in distributed-memory multicomputers. 152-159 - Sotirios G. Ziavras:
A class of scalable architectures for high-performance, cost-effective parallel computing. 162-169 - Silvia M. Müller, Benedict Gomes:
Efficient mapping of randomly sparse neural networks on parallel vector supercomputers. 170-177 - Andrew J. Bennett, Paul H. J. Kelly, Ross A. Paterson:
Derivation and performance of a pipelined transaction processor. 178-185 - Sabine R. Öhring, Dirk H. Hohndel:
Optimal fault-tolerant communication algorithms on product networks using spanning trees. 188-195 - Linda F. Wilson, Mario J. Gonzalez:
Synchronization and communication in algorithmic structures. 196-203 - Ricardo Bianchini, Thomas J. LeBlanc:
Eager combining: a coherency protocol for increasing effective network and memory bandwidth in shared-memory multiprocessors. 204-213 - Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber:
Optimal multiple message broadcasting in telephone-like communication systems. 216-223 - Adele A. Rescigno:
Optimal polling in communication networks. 224-231 - Gary L. Peterson, Byungho Yi:
Election on faulty rings with incomplete size information. 232-239 - Eddy Fromentin, Michel Raynal:
Inevitable global states: a concept to detect unstable properties of distributed computations in an observer independent way. 242-248 - Vijay K. Garg, Alexander I. Tomlinson:
Causality versus time: how to specify and verify distributed algorithms. 249-256 - Lifu Guo, Kai Salomaa, Sheng Yu:
Synchronization expressions and languages. 257-264 - Ornan Ori Gerstel, Shmuel Zaks, Michel Hurfin, Noël Plouzeau, Michel Raynal:
On-the-fly replay: a practical paradigm and its implementation for distributed debugging. 266-272 - Ronald Fernandes, Donald K. Friesen, Arkady Kanevsky:
Embedding rings in recursive networks. 273-280 - Dennis Edwards, Phil Kearns:
DTVS: a distributed trace visualization system. 281-288 - Ajay Mohindra, Murthy V. Devarakonda:
Distributed token management in Calypso file system. 290-297 - Shikharesh Majumdar, Yiu Ming Leung:
Characterization of applications with I/O for processor scheduling in multiprogrammed parallel systems. 298-307 - Gregory D. Peterson, Roger D. Chamberlain:
Sharing networked workstations: a performance model. 308-315 - Ming-Dong Feng, Chung-Kwong Yuen:
Dynamic load balancing on a distributed system. 318-325 - Banu Özden, Aaron J. Goldberg, Abraham Silberschatz:
Virtual computers-a new paradigm for distributed operating systems. 326-333 - David Glasco, Bruce Delagi, Michael J. Flynn:
Write grouping for update-based cache coherence protocols. 334-341 - Ravi Prakash, Mukesh Singhal:
Maximal global snapshot with concurrent initiators. 344-351 - Chao Feng, Laxmi N. Bhuyan, Fabrizio Lombardi:
A divide-and-conquer methodology for system-level diagnosis of processor arrays. 352-359 - Chung-Sheng Li, Ming-Syan Chen, Philip S. Yu, Hui-I Hsiao:
Combining replication and parity approaches for fault-tolerant disk arrays. 360-367 - P. R. Venkata Subramaniam, Kam-Hoi Cheng:
Simultaneous access renegable priority queues. 370-376 - Sajal K. Das, Falguni Sarkar:
Conflict-free data access of arrays and trees in parallel memory systems. 377-384 - Hyunmin Park, Dharma P. Agrawal:
WICI: an efficient switching scheme for large scalable networks. 385-392 - Premkumar Vadapalli, Pradip K. Srimani:
A new family of fixed degree Cayley networks for multiprocessor design. 394-401 - Charles M. Fiduccia, Kevin J. Rappoport:
Pin-efficient networks for cubic neighborhoods. 402-408 - Pavel Tvrdík:
Necklaces and scalability of Kautz digraphs. 409-415 - Andrew P. Wack:
A practical communication cost formula for users of message passing systems. 418-425 - Yu-Kwong Kwok, Ishfaq Ahmad:
Exploiting duplication to minimize the execution times of parallel programs on message-passing systems. 426-433 - Marios D. Dikaiakos, Kenneth Steiglitz, Anne Rogers:
A comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors. 434-442 - C. P. Ravikumar, G. Manimaran:
Star-Graph based multistage interconnection network for ATM switch fabric. 444-451 - Chi-Ming Chiang, S. Bhattacharya, Lionel M. Ni:
Multicast in extra-stage multistage interconnection networks. 452-459 - Yashovardhan R. Potlapalli, Dharma P. Agrawal:
Bounds on the number of passes in multistage interconnection networks. 460-467 - Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman
:
The reconfigurable ring of processors: fine-grained tree-structured computations. 470-477 - Lixin Gao, Arnold L. Rosenberg:
On balancing computational load on rings of processors. 478-483 - Kevin J. Rappoport:
The red-blue algorithm for dynamic programming on linear arrays. 484-488 - Abhiram Ranade, Szu-Tsung Cheng, Etienne Deprit, Jeff A. Jones, Sun-Inn Shih:
Parallelism and locality in priority queues. 490-496 - Lata Narayanan, Anne Condon:
Upper and lower bounds for selection on the mesh. 497-504 - Dina Kravets, C. Greg Plaxton:
An optimal hypercube algorithm for the all nearest smaller values problem. 505-512 - Paul F. Dietz, Rajeev Raman:
Very fast optimal parallel algorithms for heap construction. 514-521 - Yanjun Zhang, A. Ortynski:
The efficiency of randomized parallel backtrack search. 522-529 - Flaminia L. Luccio:
On the convergence of a parallel algorithm for finding polynomial zeros. 530-535 - Xiaotie Deng, Nian Gu:
Good algorithm design style for multiprocessors. 538-543 - Susanne E. Hambrusch, Ashfaq A. Khokhar:
C3: an architecture-independent model for coarse-grained parallel machines. 544-551 - Fabrizio Luccio, Linda Pagli:
Computational bounds for the simple and the MRMW PRAM. 552-557 - Xiaodong Zhang, Zhichen Xu, Lin Sun:
Performance predictions on implicit communication systems. 560-568 - Tong Sun, Qing Yang:
Performance of SPEC92 on prime-mapped vector cache. 569-576 - Lizyamma Kurian, Yu-cheng Liu:
Performance model for a prioritized multiple-bus multiprocessor system. 577-584 - Frank Dehne, Claire Kenyon, Andreas Fabri:
Scalable and architecture independent parallel geometric algorithms with high probability optimal time. 586-593 - Jehoshua Bruck, Luc De Coster, Natalie Dewulf, Ching-Tien Ho, Rudy Lauwereins:
On the design and implementation of broadcast and global combine operations using the postal model. 594-602 - Subburajan Ponnuswamy, Vipin Chaudhary:
Embedding of cycles in rotator and incomplete rotator graphs. 603-610 - Mats Brorsson, Per Stenström:
Modelling accesses to migratory and producer-consumer characterised data in a shared memory multiprocessor. 612-619 - Chiung-San Lee, Tai-Ming Parng, Jew-Chin Lee, Cheng-Nan Tsai, Kwo-Jean Farn:
Performance analysis of the XDAC disk array system. 620-627 - Yao-Dong Bi:
Timing analysis of real-time distributed systems in CRSM's and ERL. 630-637 - Jack P. C. Verhoosel, Dieter K. Hammer, Erik J. Luit, Lonnie R. Welch:
Assignment and pre-run-time scheduling of object-based, parallel real-time processes. 638-645 - Amiya Bhattacharya, Ramesh R. Rao, Ting-Ting Y. Lin:
Performability analysis of non-repairable multicomponent systems using order statistics. 646-653 - Kuo-Shun Ding, Ching-Tien Ho, Jyh-Jong Tsay:
Matrix transpose on meshes with wormhole and XY routing. 656-663 - Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Towards practical permutation routing on meshes. 664-671 - Ching-Tien Ho, Ming-Yang Kao:
Efficient submesh permutations in wormhole-routed meshes. 672-678 - Chiu-Chuan Lin, Ferng-Ching Lin:
Minimal turn restrictions for designing deadlock-free adaptive routing. 680-687 - Ziqiang Liu, Andrew A. Chien:
Hierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing. 688-695 - Paul Cull, Shawn M. Larson:
Wormhole routing algorithms for twisted cube networks. 696-703 - Majed Z. Al-Hajery, Kenneth E. Batcher:
ON the role of K-Bits bitonic sorting network in multicast routing. 706-714 - Steven Cheung, Francis C. M. Lau:
Routing with locality in partitioned-bus meshes. 715-721 - Rajendra V. Boppana, Suresh Chalasani, Cauligi S. Raghavendra:
On multicast wormhole routing in multicomputer networks. 722-729
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 2026-01-27 23:57 CET 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:
