default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. SPDP 1995: San Antonio, Texas, USA
- Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, SPDP 1995, San Antonio, Texas , USA, October 25-28, 1995. IEEE 1995, ISBN 0-8186-7195-5
- Rachid Guerraoui
, André Schiper:
The Decentralized Non-Blocking Atomic Commitment Protocol. 2-9 - Shigang Chen, Yi Deng, Wei Sun, Naphtali Rishe:
Efficient algorithms for detection and resolution of distributed deadlocks. 10-16 - Jean Mayo, Phil Kearns:
Global predicates in rough real time. 17-24 - Xiaodong Zhang, Yong Yan:
Modeling and characterizing parallel computing performance on heterogeneous networks of workstations. 25-34 - Yu-Kwong Kwok, Ishfaq Ahmad:
Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. 36-43 - James E. Beck, Daniel P. Siewiorek:
Automated processor specification and task allocation for embedded multicomputer systems: The packing-based approaches. 44-51 - Dugki Min, Matt W. Mutka:
Efficient job scheduling in a mesh multicomputer without discrimination against large jobs. 52-59 - Sekhar Darbha, Dharma P. Agrawal:
A fast and scalable scheduling algorithm for distributed memory systems. 60-63 - Prasad R. Chalasani, Krishnaiyan Thulasiraman:
Parallel computing for network optimization: a cluster-based approach for the dual transshipment problem. 66-73 - Darren Erik Vengroff, Jeffrey Scott Vitter:
Supporting I/O-efficient scientific computation in TPIE. 74-77 - Jane You, Weiping Zhu, Harvey A. Cohen, Edwige E. Pissaloux:
Fast object recognition by parallel image matching on a distributed system. 78-85 - Cheolwhan Lee, Tao Yang, Yuan-Fang Wang:
Partitioning and scheduling for parallel image processing operations. 86-90 - Hyunmin Park, Dharma P. Agrawal:
Efficient deadlock-free wormhole routing in shuffle based networks. 92-99 - Hasan Md. Sayeed, Hosame Abu-Amara:
Perfectly secure message transmission in asynchronous networks. 100-105 - Chi-Ming Chiang, Lionel M. Ni:
Efficient software multicast in wormhole-routed unidirectional multistage networks. 106-113 - Yih Huang, Philip K. McKinley:
An adaptive global reduction algorithm for wormhole-routed 2D meshes. 114-119 - Robert Cypher:
Minimal, deadlock-free routing in hypercubic and arbitrary networks. 122-129 - Christophe Calvin, Stéphane Pérennes, Denis Trystram:
All-to-all broadcast in torus with wormhole-like routing. 130-137 - Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The polling primitive for hypercube networks. 138-144 - Yosi Ben-Asher, Ilan Newman:
Geometric approach for optimal routing on mesh with buses. 145-152 - Tsan-sheng Hsu, V. Ramaehandran:
Efficient implementation of virtual processing for some combinatorial algorithms on the MasPar MP-1. 154-159 - Jing-Fu Jenq, Wing Ning Li:
Computing the configuration space for a convex robot on hypercube multiprocessors. 160-167 - David Metz, Ben Lee:
Analyzing the benefits of a separate processor to handle messages for fine-grain multithreading. 170-173 - David H. Albonesi, Israel Koren:
Architecture and technology tradeoffs in the design of next-generation multiprocessor servers. 174-181 - Krishna M. Kavi, Ali R. Hurson:
Cache memories in dataflow architecture. 182-189 - Jack B. Dennis, Guang R. Gao:
On memory models and cache management for shared-memory multiprocessors. 190-193 - Jatin Upadhyay, Prasant Mohapatra:
An efficient processor allocation scheme for mesh connected parallel computers. 196-203 - Yi-Long Chen, Ying Zhang, Jyh-Charn Liu:
Dynamic processor sharing in torus multicomputers. 204-207 - Keqin Li:
Stochastic bounds for parallel program execution times with processor constraints. 208-213 - Weifa Liang, Hong Shen:
Fully dynamic maintaining 2-edge connectivity in parallel. 216-223 - Amit Jain:
Parallel search in matrices with sorted columns. 224-230 - Philip D. MacKenzie:
A lower bound for the QRQW PRAM. 231-237 - Yossi Matias, Assaf Schuster:
Fast, efficient mutual and self simulations for shared memory and reconfigurable mesh. 238-246 - Jie Wu:
Extended Fibonacci cubes. 248-251 - Mingyao Yang, Lionel M. Ni:
Incremental design of scalable interconnection networks using basic building blocks. 252-259 - Boseob Kwon, Byungho Kim, Jaehyung Park, Hyunsoo Yoon, Jung Wan Cho:
Performance analysis of output buffers in multistage interconnection networks with multiple paths. 260-265 - Hongin Choi, Kenneth E. Batcher:
Fault detection in bitonic sorting networks. 266-270 - Ciarán Bryce, Gilles Muller:
Matching micro-kernels to modern applications using fine-grained memory protection. 272-279 - Navin Budhiraja, Keith Marzullo:
Tradeoffs in implementing primary-backup protocols. 280-288 - Murthy V. Devarakonda, Ananda Rao Ladi, Andy Zlotek, Ajay Mohindra:
Disk space guarantees as a distributed resource management problem: A case study. 289-292 - Philip Bohannon, Daniel F. Lieuwen, Abraham Silberschatz, S. Sudarshan, Jaques Gava:
Recoverable user-level mutual exclusion. 293-301 - Theodore Johnson:
Designing a distributed queue. 304-311 - Marina Papatriantafilou, Philippas Tsigas:
Wait-free consensus in "in-phase" multiprocessor systems. 312-319 - Edward J. Segall:
Resilient distributed objects: Basic results and application to shared tuple spaces. 320-327 - Sushil K. Prasad, Sagar I. Sawant:
Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors. 328-335 - Azer Bestavros:
Demand-based document dissemination to reduce traffic and balance load in distributed information systems. 338-345 - Emile Haddad:
Optimal load sharing in dynamically heterogeneous systems. 346-353 - Prakash Arunachalam, Craig M. Chase, Jacob A. Abraham:
A memory distribution mechanism for object oriented applications. 354-357 - Tao Yang, Oscar H. Ibarra:
On symbolic scheduling and parallel complexity of loops. 360-367 - Rajiv Gupta, Rastislav Bodík:
Adaptive loop transformations for scientific programs. 368-375 - Santosh Pande:
A communication+computation load balanced loop partitioning method. 376-381 - Alain Darte, Michèle Dion, Yves Robert:
A characterization of one-to-one modular mappings. 382-389 - Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi:
A generalized utility for parallel branch and bound algorithms. 392-401 - Cheng-Zhong Xu, Stefan Tschöke, Burkhard Monien:
Performance evaluation of load distribution strategies in parallel branch and bound computations. 402-405 - Ravi V. Shankar, Sanjay Ranka:
Highly irregular data accesses with hot spots on a coarse-grained parallel machine. 406-413 - David Nassimi, Milind Joshi, Andrew Sohn:
H-PBS: a hash-based scalable technique for parallel bidirectional search. 414-421 - Enrico Pontelli, Gopal Gupta:
Data parallel logic programming in &ACE. 424-431 - Vijay K. Garg, Alexander I. Tomlinson, Eddy Fromentin, Michel Raynal:
Expressing and detecting control flow properties of distributed computations. 432-438 - Lonnie R. Welch, Binoy Ravindran, Jorge Henriques, Dieter K. Hammer:
Metrics and techniques for automatic partitioning and assignment of object-based concurrent programs. 440-447 - Tim Brecht, Xiaotie Deng, Nian Gu:
Competitive dynamic multiprocessor allocation for parallel applications. 448-455 - Thomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien:
Towards developing universal dynamic mapping algorithms. 456-459 - Injong Jee:
Optimal fault-tolerant resource allocation in dynamic distributed systems. 460-467 - Mei-Ling Li, Divyakant Agrawal, Amr El Abbadi:
The performance of replica control protocols in the presence of site failures. 470-477 - Paul Keltcher, Robert Michael Owens, Mary Jane Irwin:
A simulation methodology for evaluating parallel computers. 478-481 - Ian Watson, Alasdair Rawsthorne, Mike Cumpstey, Florent Charpin:
An evaluation of DELTA, a decoupled pre-fetching virtual shared memory system. 482-487 - David Kotz:
Expanding the potential for disk-directed I/O. 490-495 - Bala Swaminathan, Kenneth J. Goldman:
Dynamic reconfiguration with I/O abstraction. 496-501 - Shikharesh Majumdar, Faisal Shad:
Characterization and management of I/O on multiprogrammed parallel systems. 502-510 - Alexander Thomasian:
Rebuild options in RAID5 disk arrays. 511-518 - Patrick T. Gaughan:
Data streaming: very low overhead communication for fine-grained multicomputing. 520-523 - Wei-Kang Huang, Xiao-Tao Chen, Laxmi N. Bhuyan, Fabrizio Lombardi:
Accurate communication models for task scheduling in multicomputers. 524-529 - William Gropp, Ewing L. Lusk:
Dynamic process management in an MPI setting. 530-533 - Robert Cypher, Eric Leu:
Efficient race detection for message-passing programs with nonblocking sends and receives. 534-541 - Danny Z. Chen, Ajay K. Gupta:
Weighted selection on coarse-grain hypercubes. 544-552 - Eunice E. Santos:
Solving triangular linear systems in parallel using substitution. 553-560 - Afonso Ferreira, Andrew Rau-Chaplin, Stéphane Ubéda:
Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. 561-568 - Pilar de la Torre, Clyde P. Kruskal:
A structural theory of recursively decomposable parallel processor-networks. 570-578 - Kevin J. Rappoport:
Bandwidth-based upper bounds on the scalability of micro-grained network machines. 579-586 - George Chochia, Murray Cole, Todd Heywood:
Implementing the hierarchical PRAM on the 2D mesh: analyses and experiments. 587-594 - Nicholas S. Bowen, Christos A. Polyzois, Richard D. Regan:
Restart services for highly available systems. 596-601 - Jian Xu, Robert H. B. Netzer, Milon Mackey:
Sender-based message logging for reducing rollback propagation. 602-609 - Qingyan Wang, Nelson L. Passos, Edwin Hsing-Mean Sha:
Multi-level partitioning and scheduling under local memory constraint. 612-619 - Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Optimal architecture-independent scheduling of fine-grain tree-sweep computations. 620-629 - Seong-Moo Yoo, Hee Yong Youn:
An on-line scheduling and allocation scheme for real-time tasks in 2D meshes. 630-637 - Pai-Chou Wang, Willard Korfhage:
Process scheduling using genetic algorithms. 638-641 - Francescomaria Marino:
A fixed-point parallel convolver without precision loss for the real-time processing of long numerical sequences. 644-651 - Yanjun Zhang, Si-Qing Zheng:
Design and analysis of a systolic sorting architecture. 652-659 - Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
Hop-congestion trade-offs for high-speed networks. 662-667 - Sook-Yeon Kim, Kyung-Yong Chwa:
Edge-disjoint embedding of large full binary trees into hypercubes. 669-672 - Qian-Ping Gu, Shietung Peng:
An efficient algorithm for k-pairwise node disjoint path problem in hypercubes. 673-680 - Ladislav Stacho, Imrich Vrt'o:
Bisection widths of transposition graphs. 681-688 - Marwan H. Abu-Amara:
Asynchronous failure location algorithm for fiber-optic networks. 690-693 - Ye-In Chang, Yao-Jen Chang:
A fault-tolerant triangular mesh protocol for distributed mutual exclusion. 694-701 - Jae-Hyun Park, Hyunsoo Yoon, Heung-Kyu Lee:
The cyclic banyan network: a fault tolerant multistage interconnection network with the fully-adaptive self-routing. 702-710 - Sabine R. Öhring, Maximilian Ibel, Sajal K. Das:
Reliable broadcasting in product networks in the presence of faulty nodes. 711-718 - Andrew Sohn:
Solving hard satisfiability problems with synchronous simulated annealing on the AP1000 multiprocessor. 719-722
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-01-18 01:12 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:
