Parallel Computing, Volume 26

Volume 26, Number 1, January 2000

• Georg Ch. Pflug, Artur Swietanowski:
  Selected parallel optimization methods for financial management under uncertainty. 3-25
  
• Benoît Bourbeau, Teodor Gabriel Crainic, Bernard Gendron:
  Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. 27-46
  
• Ricardo C. Corrêa:
  A parallel approximation scheme for the multiprocessor scheduling problem. 47-72
  
• Stella C. S. Porto, Joao Paulo Kitajima, Celso C. Ribeiro:
  Performance evaluation of a parallel tabu search task scheduling algorithm. 73-90
  
• Michel Toulouse, Teodor Gabriel Crainic, Krishnaiyan Thulasiraman:
  Global optimization properties of parallel cooperative search algorithms: A simulation study. 91-112
  
• Daniel González-Morales, Francisco Almeida, Casiano Rodríguez, José L. Roda, I. Coloma, A. Delgado:
  Parallel dynamic programming and automata theory. 113-134
  
• M. D. Durand, Steve R. White:
  Trading accuracy for speed in parallel simulated annealing with simultaneous moves. 135-150
  
• István Maros, Gautam Mitra:
  Investigating the sparse simplex algorithm on a distributed memory multiprocessor. 151-170
  

Volume 26, Number 2-3, February 2000

• Mohammed Atiquzzaman, Pradip K. Srimani:
  Parallel computing on clusters of workstations. 175-177
  
• W.-M. Lin, W. Xie:
  Load-skewing task assignment to minimize communication conflicts on network of workstations. 179-197
  
• Stephen R. Donaldson, Jonathan M. D. Hill, David B. Skillicorn:
  BSP clusters: High performance, reliable and very low cost. 199-242
  
• Ron Brightwell, Lee Ann Fisk, David S. Greenberg, Trammell Hudson, Michael Levenhagen, Arthur B. Maccabe, Rolf Riesen:
  Massively parallel computing using commodity components. 243-266
  
• Nordine Melab, El-Ghazali Talbi:
  Parallel adaptive computing on meta-systems including NOWs. 267-284
  
• John C. Chu, Patrick W. Dowd:
  Adaptive cache coherence over a high bandwidth broadband mesh network. 285-311
  
• Edward K. Blum, Xin Wang, Patrick Leung:
  Architectures and message-passing algorithms for cluster computing: Design and performance. 313-332
  
• Giovanni Chiola, Giuseppe Ciaccio:
  Efficient parallel processing on low-cost clusters with GAMMA active ports. 333-354
  
• Yung-Lin Liu, Chung-Ta King:
  EXPLORER: Supporting run-time parallelization of DOACROSS loops on general networks of workstations. 355-375
  

Volume 26, Number 4, March 2000

• Nathalie Marco, Stéphane Lanteri:
  A two-level parallelization strategy for Genetic Algorithms applied to optimum shape design. 377-397
  
• Moez Ayed, Jean-Luc Gaudiot:
  An efficient heuristic for code partitioning. 399-426
  
• Peter K. K. Loh, Wen-Jing Hsu:
  The Josephus cube: A novel interconnection network. 427-453
  
• Pao Hwa Sui, Sheng-De Wang:
  A fault-tolerant routing algorithm for wormhole routed meshes. 455-465
  
• Taesoon Park, Heon Young Yeom:
  Application controlled checkpointing coordination for fault-tolerant distributed computing systems. 467-482
  
• Costas S. Iliopoulos, James F. Reid:
  Optimal parallel analysis and decomposition of partially occluded strings. 483-494
  
• Alessandro Bevilacqua, E. Loli Piccolomini:
  Parallel image restoration on parallel and distributed computers. 495-506
  

Volume 26, Number 5, March 2000

• Erricos John Kontoghiorghes, Anna Nagurney, Berç Rustem:
  Parallel computing in economics, finance and decision-making. 507-509
  
• S. A. MirHassani, Caro Lucas, G. Mitra, E. Messina, C. A. Poojari:
  Computational solution of capacity planning models under uncertainty. 511-538
  
• G. Zanghirati, F. Cocco, G. Paruolo, F. Taddei:
  A Cray T3E implementation of a parallel stochastic dynamic assets and liabilities management model. 539-567
  
• Cyril Godart:
  Parallel implementation of a two-factor Cheyette-beta model calibration. 569-586
  
• Rodolphe Chatagny, Bastien Chopard:
  A parallel model for the foreign exchange market. 587-600
  
• F. Oliver Bunnin, Yike Guo, Yuhe Ren, John Darlington:
  Design of high performance financial modelling environment. 601-622
  
• S. C. Perry, R. H. Grimwood, Darren J. Kerbyson, Efstathios Papaefstathiou, Graham R. Nudd:
  Performance optimization of financial option calculations. 623-639
  
• Jenny X. Li, Gary L. Mullen:
  Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives. 641-653
  
• Elias S. Manolakos, Haris M. Stellakis:
  Systematic synthesis of parallel architectures for the computation of higher order cumulants. 655-676
  

Volume 26, Number 6, May 2000

• E. W. Evans, S. P. Johnson, P. F. Leggett, Mark Cross:
  Automatic and effective multi-dimensional parallelisation of structured mesh based codes. 677-703
  
• Rony Keppens, Gábor Tóth:
  Using high performance Fortran for magnetohydrodynamic simulations. 705-722
  
• Keqin Li, Yi Pan, Mounir Hamdi:
  Solving graph theory problems using reconfigurable pipelined optical buses. 723-735
  
• Arjen Schoneveld, Peter M. A. Sloot, Martin Lees, Erwan Karyadi:
  A framework for dynamic load balancing: A case study on explosive containment simulation. 737-751
  
• Casiano Rodríguez, José L. Roda, Francisco de Sande, Daniel González-Morales, Francisco Almeida:
  A new parallel model for the analysis of asynchronous algorithms. 753-767
  
• Huan-Chao Keh, Jen-Chih Lin:
  On fault-tolerant embedding of Hamiltonian cycles, linear arrays and rings in a Flexible Hypercube. 769-781
  
• Jan Trdlicka, Pavel Tvrdík:
  Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. 783-790
  
• Shijun Diao, T. Fujiwara:
  Evaluation and strategy of different data parallel implementation methods of a stiff chemical non-equilibrium flow solver. 791-804
  
• J. G. Liu, Francis H. Y. Chan, Francis K. Lam, H. F. Li:
  A new approach to fast calculation of moments of 3-D gray level images. 805-815
  

Volume 26, Numbers 7-8, July 2000

• Jerzy Leszczynski:
  Computational chemistry. 817-818
  
• Wanda Andreoni, Alessandro Curioni:
  New advances in chemistry and materials science with CPMD and parallel computing. 819-842
  
• C. P. Sosa, G. Scalmani, Roberto Gomperts, Michael J. Frisch:
  Ab initio quantum chemistry on a ccNUMA architecture using openMP III. 843-856
  
• John D. Watts:
  Parallel algorithms for coupled-cluster methods. 857-867
  
• Ross H. Nobes, Alistair P. Rendell, Jarek Nieplocha:
  Computational chemistry on Fujitsu vector-parallel processors: Hardware and programming environment. 869-886
  
• Alistair P. Rendell, Andrey A. Bliznyuk, Thomas Huber, Ross H. Nobes, Elena V. Akhmatskaya, Herbert A. Früchtl, Paul W.-C. Kung, Victor Milman, Han Lung:
  Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software. 887-911
  
• Piotr Piecuch, Joseph I. Landman:
  Parallelization of multi-reference coupled-cluster method. 913-943
  
• David E. Bernholdt:
  Scalability of correlated electronic structure calculations on parallel computers: A case study of the RI-MP2 method. 945-963
  
• Dennis M. Newns, Qingfeng Zhong, Preston B. Moore, T. Husslein, Pratap Pattnaik, Michael L. Klein:
  Molecular dynamics study of structure and gating of low molecular weight ion channels. 965-976
  
• Barry Robson:
  Simplified models of protein folding exploiting the Lagrange radius of gyration of the hydrophobic component. 977-998
  
• Jacek Komasa, Jacek Rychlewski:
  Solving quantum-mechanical problems on parallel systems. 999-1009
  
• Jon Baker, Matt Shirel:
  Ab initio quantum chemistry on PC-based parallel supercomputers. 1011-1024
  
• Marc Pavese, Soonmin Jang, Gregory A. Voth:
  Centroid molecular dynamics: A quantum dynamics method suitable for the parallel computer. 1025-1041
  
• Leonid Gorb, Ilya Yanov, Jerzy Leszczynski:
  High performance computing on the Cray T3E and IBM SP2 systems with the parallel version of GAUSSIAN 94. 1043-1060
  

Volume 26, Number 9, July 2000

• Jacek Blazewicz, Klaus H. Ecker, Tao Yang:
  New trends on scheduling in parallel and distributed systems. 1061-1063
  
• Jacques Verriet:
  Scheduling outtrees of height one in the LogP model. 1065-1082
  
• Welf Löwe, Wolf Zimmermann:
  Scheduling balanced task-graphs to LogP-machines. 1083-1108
  
• Tomasz Kalinowski, Iskander Kort, Denis Trystram:
  List scheduling of general task graphs under LogP. 1109-1128
  
• Chams Lahlou:
  Approximation algorithms for scheduling with a limited number of communications. 1129-1162
  
• Philippe Chrétienne:
  On Graham's bound for cyclic scheduling. 1163-1174
  
• Alain Darte:
  On the complexity of loop fusion. 1175-1193
  
• Jacek Blazewicz, Maciej Drozdowski, Piotr Formanowicz, Wieslaw Kubiak, Günter Schmidt II:
  Scheduling preemptable tasks on parallel processors with limited availability. 1195-1211
  
• Luis Miguel Campos, Isaac D. Scherson:
  Rate of change load balancing in distributed and parallel systems. 1213-1230
  

Volume 26, Number 10, 15 August 2000

• Alan D. George, Jeff Markwell, Ryan Fogarty:
  Real-time sonar beamforming on high-performance distributed computers. 1231-1252
  
• Jacques Chassin de Kergommeaux, Benhur de Oliveira Stein, Pierre-Eric Bernard:
  Pajé, an interactive visualization tool for tuning multi-threaded parallel applications. 1253-1274
  
• Weng-Long Chang, Chih-Ping Chu:
  The infinity Lambda test: A multi-dimensional version of Banerjee infinity test. 1275-1295
  
• David K. Lowenthal, Vincent W. Freeh:
  Architecture-independent parallelism for both shared- and distributed-memory machines using the Filaments package. 1297-1323
  
• Minyi Guo, Ikuo Nakata, Yoshiyuki Yamashita:
  Contention-free communication scheduling for array redistribution. 1325-1343
  
• Peter Benner, Ralph Byers, Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí:
  Solving algebraic Riccati equations on parallel computers using Newton's method with exact line search. 1345-1368
  

Volume 26, Number 11, October 2000

• Peiyi Tang, Jingling Xue:
  Generating efficient tiled code for distributed memory machines. 1369-1410
  
• Sajal K. Das, Maria Cristina Pinotti:
  Parallel priority queues based on binomial heaps. 1411-1428
  
• Clémentin Tayou Djamégni, Patrice Quinton, Sanjay V. Rajopadhye, Tanguy Risset:
  Derivation of systolic algorithms for the algebraic path problem by recurrence transformations. 1429-1445
  
• Manzur M. Murshed, Richard P. Brent:
  Adaptive AT2 optimal algorithms on reconfigurable meshes. 1447-1458
  
• Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu:
  Multicast communication in wormhole-routed star graph interconnection networks. 1459-1490
  
• J. A. Bakker:
  Semantic partitioning as a basis for parallel I/O in database management systems. 1491-1513
  

Volume 26, Number 12, November 2000

• Rupak Biswas, Bruce Hendrickson, George Karypis:
  Graph partitioning and parallel computing. 1515-1517
  
• Bruce Hendrickson, Tamara G. Kolda:
  Graph partitioning models for parallel computing. 1519-1534
  
• Nasir Touheed, Paul M. Selwood, Peter K. Jimack, Martin Berzins:
  A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver. 1535-1554
  
• Ralf Diekmann, Robert Preis, Frank Schlimbach, Chris Walshaw:
  Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM. 1555-1581
  
• Leonid Oliker, Rupak Biswas, Harold N. Gabow:
  Parallel tetrahedral mesh adaptation with dynamic load balancing. 1583-1608
  
• Burkhard Monien, Robert Preis, Ralf Diekmann:
  Quality matching and local improvement for multilevel graph-partitioning. 1609-1634
  
• Chris Walshaw, Mark Cross:
  Parallel optimisation algorithms for multilevel mesh partitioning. 1635-1660
  
• Jarmo Rantakokko:
  Partitioning strategies for structured multiblock grids. 1661-1680
  

Volume 26, Number 13-14, December 2000

• Jacques Chassin de Kergommeaux, Philip J. Hatcher, Lawrence Rauchwerger:
  Parallel computing for irregular applications. 1681-1684
  
• Manuel V. Hermenegildo:
  Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming. 1685-1708
  
• Eladio Gutiérrez, Rafael Asenjo, Oscar G. Plata, Emilio L. Zapata:
  Automatic parallelization of irregular applications. 1709-1738
  
• F. Warren Burton, David J. Simpson:
  Memory requirements for parallel programs. 1739-1763
  
• Andras Laszloffy, Jingping Long, Abani K. Patra:
  Simple data management, scheduling and solution strategies for managing the irregularities in parallel adaptive hp finite element simulations. 1765-1788
  
• Frédéric Brégier, Marie Christine Counilh, Jean Roman:
  Scheduling loops with partial loop-carried dependencies. 1789-1806
  
• Thomas Brandes, Cécile Germain-Renaud:
  A schedule cache for data parallel unstructured computations. 1807-1823
  
• Thomas Decker:
  Virtual data space - load balancing for irregular applications. 1825-1860
  
• Hwansoo Han, Chau-Wen Tseng:
  Efficient compiler and run-time support for parallel irregular reductions. 1861-1887
  
• Patrizia Beraldi, Lucio Grandinetti, Roberto Musmanno, Chefi Triki:
  Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints. 1889-1908
  
• Chai Seng Pua, M. Howard Williams, David H. Marwick:
  Modelling parallel databases with process algebra. 1909-1924
  
• Ming-Yang Su, Hui-Ling Huang, Gen-Huey Chen, Dyi-Rong Duh:
  Node-disjoint paths in incomplete WK-recursive networks. 1925-1944
  
• Roman Trobec:
  Two-dimensional regular d-meshes. 1945-1953
  

Last update Sat May 25 20:55:41 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page