Abstract is missing.
- The Decentralized Non-Blocking Atomic Commitment ProtocolRachid Guerraoui, André Schiper. 2-9 [doi]
- Efficient algorithms for detection and resolution of distributed deadlocksShigang Chen, Yi Deng, Wei Sun 0002, Naphtali Rishe. 10-16 [doi]
- Global predicates in rough real timeJean Mayo, Phil Kearns. 17-24 [doi]
- Modeling and characterizing parallel computing performance on heterogeneous networks of workstationsXiaodong Zhang 0001, Yong Yan. 25-34 [doi]
- Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architecturesYu-Kwong Kwok, Ishfaq Ahmad. 36-43 [doi]
- Automated processor specification and task allocation for embedded multicomputer systems: The packing-based approachesJames E. Beck, Daniel P. Siewiorek. 44-51 [doi]
- Efficient job scheduling in a mesh multicomputer without discrimination against large jobsDugki Min, Matt W. Mutka. 52-59 [doi]
- A fast and scalable scheduling algorithm for distributed memory systemsSekhar Darbha, Dharma P. Agrawal. 60-63 [doi]
- Parallel computing for network optimization: a cluster-based approach for the dual transshipment problemPrasad R. Chalasani, Krishnaiyan Thulasiraman. 66-73 [doi]
- Supporting I/O-efficient scientific computation in TPIEDarren Erik Vengroff, Jeffrey Scott Vitter. 74-77 [doi]
- Fast object recognition by parallel image matching on a distributed systemJane You, Weiping Zhu 0001, Harvey A. Cohen, Edwige Pissaloux. 78-85 [doi]
- Partitioning and scheduling for parallel image processing operationsCheolwhan Lee, Tao Yang, Yuan-Fang Wang. 86-90 [doi]
- Efficient deadlock-free wormhole routing in shuffle based networksHyunmin Park, Dharma P. Agrawal. 92-99 [doi]
- Perfectly secure message transmission in asynchronous networksHasan Md. Sayeed, Hosame Abu-Amara. 100-105 [doi]
- Efficient software multicast in wormhole-routed unidirectional multistage networksChi-Ming Chiang, Lionel M. Ni. 106-113 [doi]
- An adaptive global reduction algorithm for wormhole-routed 2D meshesYih Huang, Philip K. McKinley. 114-119 [doi]
- Minimal, deadlock-free routing in hypercubic and arbitrary networksRobert Cypher. 122-129 [doi]
- All-to-all broadcast in torus with wormhole-like routingChristophe Calvin, Stéphane Pérennes, Denis Trystram. 130-137 [doi]
- The polling primitive for hypercube networksAndrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam. 138-144 [doi]
- Geometric approach for optimal routing on mesh with busesYosi Ben-Asher, Ilan Newman. 145-152 [doi]
- Efficient implementation of virtual processing for some combinatorial algorithms on the MasPar MP-1Tsan-sheng Hsu, V. Ramaehandran. 154-159 [doi]
- Computing the configuration space for a convex robot on hypercube multiprocessorsJing-Fu Jenq, Wing Ning Li. 160-167 [doi]
- Analyzing the benefits of a separate processor to handle messages for fine-grain multithreadingDavid Metz, Ben Lee. 170-173 [doi]
- Architecture and technology tradeoffs in the design of next-generation multiprocessor serversDavid H. Albonesi, Israel Koren. 174-181 [doi]
- Cache memories in dataflow architectureKrishna M. Kavi, Ali R. Hurson. 182-189 [doi]
- On memory models and cache management for shared-memory multiprocessorsJack B. Dennis, Guang R. Gao. 190-193 [doi]
- An efficient processor allocation scheme for mesh connected parallel computersJatin Upadhyay, Prasant Mohapatra. 196-203 [doi]
- Dynamic processor sharing in torus multicomputersYilong Chen, Ying Zhang, Jyh-Charn Liu. 204-207 [doi]
- Stochastic bounds for parallel program execution times with processor constraintsKeqin Li. 208-213 [doi]
- Fully dynamic maintaining 2-edge connectivity in parallelWeifa Liang, Hong Shen. 216-223 [doi]
- Parallel search in matrices with sorted columnsAmit Jain. 224-230 [doi]
- A lower bound for the QRQW PRAMPhilip D. MacKenzie. 231-237 [doi]
- Fast, efficient mutual and self simulations for shared memory and reconfigurable meshYossi Matias, Assaf Schuster. 238-246 [doi]
- Extended Fibonacci cubesJie Wu 0001. 248-251 [doi]
- Incremental design of scalable interconnection networks using basic building blocksMingyao Yang, Lionel M. Ni. 252-259 [doi]
- Performance analysis of output buffers in multistage interconnection networks with multiple pathsBoseob Kwon, Byungho Kim, Jaehyung Park, Hyunsoo Yoon, Jung Wan Cho. 260-265 [doi]
- Fault detection in bitonic sorting networksHongin Choi, Kenneth E. Batcher. 266-270 [doi]
- Matching micro-kernels to modern applications using fine-grained memory protectionCiarán Bryce, Gilles Muller. 272-279 [doi]
- Tradeoffs in implementing primary-backup protocolsNavin Budhiraja, Keith Marzullo. 280-288 [doi]
- Disk space guarantees as a distributed resource management problem: A case studyMurthy V. Devarakonda, Ananda Rao Ladi, Andy Zlotek, Ajay Mohindra. 289-292 [doi]
- Recoverable user-level mutual exclusionPhilip Bohannon, Daniel F. Lieuwen, Abraham Silberschatz, S. Sudarshan 0001, J. Gava. 293-301 [doi]
- Designing a distributed queueTheodore Johnson. 304-311 [doi]
- Wait-free consensus in "in-phase" multiprocessor systemsMarina Papatriantafilou, Philippas Tsigas. 312-319 [doi]
- Resilient distributed objects: Basic results and application to shared tuple spacesEdward J. Segall. 320-327 [doi]
- Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessorsSushil K. Prasad, Sagar I. Sawant. 328-335 [doi]
- Demand-based document dissemination to reduce traffic and balance load in distributed information systemsAzer Bestavros. 338-345 [doi]
- Optimal load sharing in dynamically heterogeneous systemsEmile Haddad. 346-353 [doi]
- A memory distribution mechanism for object oriented applicationsPrakash Arunachalam, Craig M. Chase, Jacob A. Abraham. 354-357 [doi]
- On symbolic scheduling and parallel complexity of loopsTao Yang, Oscar H. Ibarra. 360-367 [doi]
- Adaptive loop transformations for scientific programsRajiv Gupta, Rastislav Bodík. 368-375 [doi]
- A communication+computation load balanced loop partitioning methodSantosh Pande. 376-381 [doi]
- A characterization of one-to-one modular mappingsAlain Darte, Michèle Dion, Yves Robert. 382-389 [doi]
- A generalized utility for parallel branch and bound algorithmsYuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi. 392-401 [doi]
- Performance evaluation of load distribution strategies in parallel branch and bound computationsCheng-Zhong Xu, Stefan Tschöke, Burkhard Monien. 402-405 [doi]
- Highly irregular data accesses with hot spots on a coarse-grained parallel machineRavi V. Shankar, Sanjay Ranka. 406-413 [doi]
- H-PBS: a hash-based scalable technique for parallel bidirectional searchDavid Nassimi, Milind Joshi, Andrew Sohn. 414-421 [doi]
- Data parallel logic programming in &ACEEnrico Pontelli, Gopal Gupta. 424-431 [doi]
- Expressing and detecting control flow properties of distributed computationsVijay K. Garg, Alexander I. Tomlinson, Eddy Fromentin, Michel Raynal. 432-438 [doi]
- Metrics and techniques for automatic partitioning and assignment of object-based concurrent programsLonnie R. Welch, Binoy Ravindran, Jorge Henriques, Dieter K. Hammer. 440-447 [doi]
- Competitive dynamic multiprocessor allocation for parallel applicationsTim Brecht, Xiaotie Deng, Nian Gu. 448-455 [doi]
- Towards developing universal dynamic mapping algorithmsThomas Decker, Ralf Diekmann, Reinhard Lüling, Burkhard Monien. 456-459 [doi]
- Optimal fault-tolerant resource allocation in dynamic distributed systemsInjong Jee. 460-467 [doi]
- The performance of replica control protocols in the presence of site failuresM. L. Liu, Divyakant Agrawal, Amr El Abbadi. 470-477 [doi]
- A simulation methodology for evaluating parallel computersP. Keltcher, Robert Michael Owens, Mary Jane Irwin. 478-481 [doi]
- An evaluation of DELTA, a decoupled pre-fetching virtual shared memory systemIan Watson, Alasdair Rawsthorne, Mike Cumpstey, Florent Charpin. 482-487 [doi]
- Expanding the potential for disk-directed I/ODavid Kotz. 490-495 [doi]
- Dynamic reconfiguration with I/O abstractionBala Swaminathan, Kenneth J. Goldman. 496-501 [doi]
- Characterization and management of I/O on multiprogrammed parallel systemsShikharesh Majumdar, Faisal Shad. 502-510 [doi]
- Rebuild options in RAID5 disk arraysAlexander Thomasian. 511-518 [doi]
- Data streaming: very low overhead communication for fine-grained multicomputingPatrick T. Gaughan. 520-523 [doi]
- Accurate communication models for task scheduling in multicomputersWei-Kang Huang, Xiao-Tao Chen, Laxmi N. Bhuyan, Fabrizio Lombardi. 524-529 [doi]
- Dynamic process management in an MPI settingWilliam Gropp, Ewing L. Lusk. 530-533 [doi]
- Efficient race detection for message-passing programs with nonblocking sends and receivesRobert Cypher, Eric Leu. 534-541 [doi]
- Weighted selection on coarse-grain hypercubesDanny Z. Chen, Ajay K. Gupta. 544-552 [doi]
- Solving triangular linear systems in parallel using substitutionEunice E. Santos. 553-560 [doi]
- Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputersAfonso Ferreira, Andrew Rau-Chaplin, S. Ueda. 561-568 [doi]
- A structural theory of recursively decomposable parallel processor-networksPilar de la Torre, Clyde P. Kruskal. 570-578 [doi]
- Bandwidth-based upper bounds on the scalability of micro-grained network machinesKevin J. Rappoport. 579-586 [doi]
- Implementing the hierarchical PRAM on the 2D mesh: analyses and experimentsGeorge Chochia, Murray Cole, Todd Heywood. 587-594 [doi]
- Restart services for highly available systemsNicholas S. Bowen, Christos A. Polyzois, Richard D. Regan. 596-601 [doi]
- Sender-based message logging for reducing rollback propagationJian Xu, Robert H. B. Netzer, Milon Mackey. 602-609 [doi]
- Multi-level partitioning and scheduling under local memory constraintQingyan Wang, Nelson L. Passos, Edwin Hsing-Mean Sha. 612-619 [doi]
- Optimal architecture-independent scheduling of fine-grain tree-sweep computationsLixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman. 620-629 [doi]
- An on-line scheduling and allocation scheme for real-time tasks in 2D meshesSeong-Moo Yoo, Hee Yong Youn. 630-637 [doi]
- Process scheduling using genetic algorithmsPai-Chou Wang, Willard Korfhage. 638-641 [doi]
- A fixed-point parallel convolver without precision loss for the real-time processing of long numerical sequencesFrancescomaria Marino. 644-651 [doi]
- Design and analysis of a systolic sorting architectureYanjun Zhang, Si-Qing Zheng. 652-659 [doi]
- Hop-congestion trade-offs for high-speed networksEvangelos Kranakis, Danny Krizanc, Andrzej Pelc. 662-667 [doi]
- Edge-disjoint embedding of large full binary trees into hypercubesSook-Yeon Kim, Kyung-Yong Chwa. 669-672 [doi]
- An efficient algorithm for k-pairwise node disjoint path problem in hypercubesQian-Ping Gu, Shietung Peng. 673-680 [doi]
- Bisection widths of transposition graphsLadislav Stacho, Imrich Vrt'o. 681-688 [doi]
- Asynchronous failure location algorithm for fiber-optic networksMarwan H. Abu-Amara. 690-693 [doi]
- A fault-tolerant triangular mesh protocol for distributed mutual exclusionYe-In Chang, Yao-Jen Chang. 694-701 [doi]
- The cyclic banyan network: a fault tolerant multistage interconnection network with the fully-adaptive self-routingJae-Hyun Park, Hyunsoo Yoon, Heung-Kyu Lee. 702-710 [doi]
- Reliable broadcasting in product networks in the presence of faulty nodesSabine R. Öhring, Maximilian Ibel, Sajal K. Das. 711-718 [doi]
- Solving hard satisfiability problems with synchronous simulated annealing on the AP1000 multiprocessorAndrew Sohn. 719-722 [doi]