Table of Contents

• A genetic algorithm for assembling optical computers using faulty optical arraysC. P. Ravikumar, Augustine R. Thomas, Abhay Gupta. 4-9 [doi]
• Comparison of parallelization strategies for simulation of aerodynamics problemSimon Chong Wee See. 10-15 [doi]
• File allocation for a parallel WebserverRahul Simha, Bhagirath Narahari, Hyeong-Ah Choi, Li-Chuan Chen. 16-21 [doi]
• Parallel genetic algorithms on PARAM for conformation of biopolymersV. Sundararajan, Ashok S. Kolaskar. 22-26 [doi]
• Parallel SOLVE for direct circuit simulation on a transputer arrayYul Chu, Ausif Mahmood, Donald J. Lynch. 27-32 [doi]
• Monte Carlo device simulation on PARAMAshwani Harkar, A. D. Shaligram, S. V. Ghaisas, V. Sundararajan. 33-35 [doi]
• Classification of handwritten alphanumeric characters: a fuzzy neural approachS. Annadurai, A. Balasubramaniam. 36-41 [doi]
• Techniques for increasing the stream capacity of a multimedia serverDivyesh Jadav, Alok N. Choudhary. 43-48 [doi]
• Compiling object-oriented programs for distributed executionPrakash K. Muthukrishnan, Barrett R. Bryant, Amy E. Zwarico. 49-54 [doi]
• The RAID configuration toolPeter Zabback, Jai Menon 0001, Jeff Riegel. 55-61 [doi]
• Efficient compilation of concurrent call/return communication in actor-based programming languagesWooYoung Kim, Gul A. Agha, Rajendra Panwar. 62-67 [doi]
• Integrating concurrency and object-orientation using boolean, access and path guardsA. S. M. Sajeev, Heinz W. Schmidt. 68-72 [doi]
• Compilation to parallel programs from constraintsAjita John, James C. Browne. 73-79 [doi]
• Finite element calculations at the parallel computers Intel/Paragon, IBM SP-2, and a cluster of DEC-ALPHA workstationsAstrid Watermann, Jürgen Altes. 82-87 [doi]
• Program-level control of network delay for parallel asynchronous iterative applicationsP. J. Joseph, Sriram Vajapeyam. 88-93 [doi]
• Adaptive integration using evolutionary strategiesElise de Doncker, Ajay K. Gupta, Garrison W. Greenwood. 94-99 [doi]
• Finite element applications of parallel adaptive integration strategiesElise de Doncker, Patricia Ealy, Ajay K. Gupta. 100-105 [doi]
• Distributed computation of inverse dynamics of robotsRamakrishnan Rajagopalan. 106-112 [doi]
• DiET: a distributed extended transaction processing frameworkK. Hari Prasad, T. K. Nayak, R. K. Ghosh. 114-119 [doi]
• BAG real-time distributed operating systemBekir Tevfik Akgün, Ersoy Peksen, A. Emre Harmanci, Nadia Erdogan, Gurhan Menderes. 120-125 [doi]
• Bounded dynamic data allocation in distributed systemsOliver E. Theel, Henning Pagnia. 126-131 [doi]
• Transparent parallel replication of logically partitioned databasesRekha Goel, Gautam M. Shroff. 132-137 [doi]
• A distributed directory scheme for information access in mobile computersMohan Kumar, Svetha Venkatesh, Sethuraman Panchanathan. 138-143 [doi]
• Novel parallel join algorithms for grid filesSalahadin Mohammed, Balasubramaniam Srinivasan, M. Bozyigit, Phu Dung Le. 144-149 [doi]
• Congestion-free dilation-2 embedding of full binary trees on star graphsDilip K. Saikia, R. Badrinath, Ranjan K. Sen. 152-157 [doi]
• Evaluation of a Mesh of Clos wormhole networkAndy D. Pimentel, Louis O. Hertzberger. 158-164 [doi]
• An efficient scheme for embedding a ring into an injured hypercube with both faulty links and faulty nodesYu-Chee Tseng. 165-169 [doi]
• Embedding arbitrary trees in the hypercube and the q-dimensional meshJaafar Gaber, Bernard Toursel, Gilles Goncalves. 170-175 [doi]
• GSE: a generalized full-access multistage interconnection network with minimum costRajib K. Das, Nabanita Das. 176-181 [doi]
• The generalized hypercube-connected-cycle: an efficient network topologySrabani Sen Gupta, Debasish Das, Bhabani P. Sinha. 182-187 [doi]
• Program analysis for page size selectionK. Gopinath, Aniruddha P. Bhutkar. 189-194 [doi]
• Incremental data dependence analysisK. V. Praveen, Sajeev Kumar Aggarwal, R. K. Ghosh. 195-200 [doi]
• A communication placement framework with unified dependence and data-flow analysisKen Kennedy, Ajay Sethi. 201-208 [doi]
• Implementation of a pattern-matching approach for identifying algorithmic concepts in scientific FORTRAN programsJack R. Hagemeister, Sanjay Bhansali, Cauligi S. Raghavendra. 209-214 [doi]
• Run-time versus compile-time instruction scheduling in superscalar (RISC) processors: performance and tradeoffsAllen Leung, Krishna V. Palem, Cristian Ungureanu. 215-224 [doi]
• Two-dimensional orthogonal tiling: from theory to practiceRumen Andonov, Hafid Bourzoufi, Sanjay V. Rajopadhye. 225-231 [doi]
• Efficient edge extraction of images by directional tracingS. Sitharama Iyengar, Yuyan Wu, Hla Min. 233-238 [doi]
• An efficient encoding algorithm for image compression hardware based on cellular automataSubarna Bhattacharjee, U. Raghavendra, Dipanwita Roy Chowdhury, Parimal Pal Chaudhuri. 239-244 [doi]
• A comparison of bit-serial and multi-bit processor elements in a real-time signal processing SIMD architectureAnders Åström, Michael Hall, Anders Edman. 245-250 [doi]
• A parallel algorithm for stereo vision based on correlationJ. C. M. Van Beek, Johan J. Lukkien. 251-256 [doi]
• Spatial frequency based motion estimation for image sequence compressionVinod Menezes, Soumitra Kumar Nandy, Biswadip Mitra. 257-262 [doi]
• Load balancing strategies for symbolic vision computationsYongwha Chung, Jongwook Woo, Ramakant Nevatia, Viktor K. Prasanna. 263-269 [doi]
• Fault tolerant networks of workstationsJohn Morris, Neil LeFevre. 271-276 [doi]
• A protocol for lossy transmission of digital videoSundeep Oberoi. 277-282 [doi]
• Independent node and process recovery in message passing distributed systemsSubhash Bhalla, M. V. Sreenivas. 283-288 [doi]
• A new study for fault-tolerant real-time dynamic scheduling algorithmsG. Manimaran, C. Siva Ram Murthy. 289-294 [doi]
• An efficient distributed single-phase protocol for total and causal ordering of group operationsChengzheng Sun, Piyush Maheshwari. 295-300 [doi]
• Incorporating fault tolerance in superscalar processorsManoj Franklin. 301-306 [doi]
• Analysis of piggybacked token-passing MAC protocol with variable buffer size for WDM star coupled photonic networkSelvakennedy Selvadurai, Ashwani Kumar Ramani. 307-312 [doi]
• Efficient parallel prefix algorithms on fully connected message-passing computersYen-Chun Lin, C. M. Lin. 316-321 [doi]
• Multicast communication algorithm on a wormhole-routed star graph interconnection networkJelena V. Misic. 322-329 [doi]
• Implementing string-to-string correction and longest common subsequence problems on the Sequent Symmetry multiprocessorSajal K. Das, Ajoy Kumar Datta, Surendra Pothuru. 330-335 [doi]
• Multithreading implementation of a distributed shortest path algorithm on EARTH multiprocessorParimala Thulasiraman, Xinmin Tian, Guang R. Gao. 336-341 [doi]
• A multithreaded architecture for the efficient execution of vector computations within a loop using status fieldSung-Dae Youn, Ki-Dong Chung. 343-350 [doi]
• Performance evaluation of a RISC neuro-processor for neural networksSuthikshn Kumar, Kevin E. Forward, Marimuthu Palaniswami. 351-356 [doi]
• Order-configurable programmable power-efficient FIR filtersChong Xu, Ching-Yi Wang, Keshab K. Parhi. 357-361 [doi]
• Quantitive studies of data-locality sensitivity on the EARTH multithreaded architecture: preliminary resultsXinmin Tian, Shashank S. Nemawarkar, Guang R. Gao, Herbert H. J. Hum, Olivier Maquelin, Angela C. Sodan, Kevin B. Theobald. 362-367 [doi]
• A distributed barrier synchronization solution in hardware for 2D-mesh multicomputersMartha Ximena Torres Delgado, Sergio Takeo Kofuji. 368-373 [doi]
• Connection caching technique with host groupingSoomi Yang, Yookun Cho. 374-378 [doi]
• A linear systolic algorithm and architecture for convex bipartite matchingNagarajan Ranganathan, Rajesh Chandra. 379-384 [doi]
• Evaluation of static scheduling algorithms improved with partial strict triggering of program graph nodesMilan Ojstersek, Viljem Zumer, Ljubo Pipan, Aleksander Kvas, Boris Benko. 386-391 [doi]
• On-line scheduling of hard real-time tasks on multiprocessorsM. Dominic, Bijendra N. Jain. 392-399 [doi]
• Exploiting parallelism in high performance embedded system schedulingBinoy Ravindran, Lonnie R. Welch. 400-405 [doi]
• A robust and flexible microeconomic scheduler for parallel computersIon Stoica, Alex Pothen. 406-412 [doi]
• A study of dynamic scheduling techniques for multiscalar processorsVamsee K. Madavarapu, Manoj Franklin, Krishna K. Sundararaman. 413-418 [doi]
• Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphsRamaswamy Govindarajan, S. Rengarajan. 419-424 [doi]
• Adaptive resource allocation for embedded parallel applicationsRakesh Jha, Mustafa Muhammad, Sudhakar Yalamanchili, Karsten Schwan, Daniela Ivan-Rosu, Chris deCastro. 425-431 [doi]
• Communicating data-parallel tasks: an MPI library for HPFIan T. Foster, David R. Kohr Jr., Rakesh Krishnaiyer, Alok N. Choudhary. 433-438 [doi]
• Cidre: programming with distributed shared arraysFrançoise André, Yves Mahéo. 439-444 [doi]
• PMDOS: a testbed for distributed and parallel algorithms utilizing idle machines in a networkK. Prabhakar, Gurusamy Mohan. 445-450 [doi]
• PARDISC: a cost effective model for parallel and distributed computingAchutha Raman R., Rajkumar, Hari Prakash G., Bala Kishore B.. 451-456 [doi]
• A co-operative application management platform based on shared virtual memoryHervé Guyennet, Jean-Christophe Lapayre. 457-462 [doi]
• An MPI implementation of the BLACSVaibhav Deshpande, William Sawyer. 463-468 [doi]
• A DSM-Based Structural Programming Environment for Distributed and Parallel ProcessingLionel Brunie, Laurent Lefèvre. 469-473 [doi]