node132.html

Design and building parallel program

A. Choudhary.
 Parallel I/O systems, guest editor's introduction.
 <em> J. Parallel and Distributed Computing</em>, 17(1--2):1--3, 1993.
<P>
<DT><A NAME=chowdhury90><STRONG>61</STRONG></A><DD>
S. Chowdhury.
 The greedy load-sharing algorithm.
 <em> J. Parallel and Distributed Computing</em>, 9(1):93--99, 1990.
<P>
<DT><A NAME=Colvin><STRONG>62</STRONG></A><DD>
M. Colvin, C. Janssen, R. Whiteside, and C. Tong.
 Parallel Direct-SCF for large-scale calculations.
 Technical report, Center for Computational Engineering, Sandia
  National Laboratories, Livermore, Cal., 1991.
<P>
<DT><A NAME=Comer><STRONG>63</STRONG></A><DD>
D. Comer.
 <em> Internetworking with TCP/IP</em>.
 Prentice-Hall, 1988.
<P>
<DT><A NAME=Cook><STRONG>64</STRONG></A><DD>
S. Cook.
 The classification of problems which have fast parallel algorithms.
 In <em> Proc. 1983 Intl Foundation of Computation Theory Conf.</em>,
  volume 158, pages 78--93. Springer-Verlag LNCS, 1983.
<P>
<DT><A NAME=Cormen><STRONG>65</STRONG></A><DD>
T. Cormen, C. Leiserson, and R. Rivest.
 <em> Introduction to Algorithms</em>.
 MIT Press, 1990.
<P>
<DT><A NAME=OOP><STRONG>66</STRONG></A><DD>
B. Cox and A. Novobilski.
 <em> Object-Oriented Programming: An Evolutionary Approach</em>.
 Addison-Wesley, 1991.
<P>
<DT><A NAME=C93><STRONG>67</STRONG></A><DD>
D. Culler et al.
 LogP: Towards a realistic model of parallel computation.
 In <em> Proc. 4th Symp. Principles and Practice of Parallel
  Programming</em>, pages 1--12. ACM, 1993.
<P>
<DT><A NAME=Cyb89><STRONG>68</STRONG></A><DD>
G. Cybenko.
 Dynamic load balancing for distributed memory multiprocessors.
 <em> J. Parallel and Distributed Computing</em>, 7:279--301, 1989.
<P>
<DT><A NAME=Dally><STRONG>69</STRONG></A><DD>
W. Dally.
 <em> A VLSI Architecture for Concurrent Data Structures</em>.
 Kluwer Academic Publishers, 1987.
<P>
<DT><A NAME=Dally1><STRONG>70</STRONG></A><DD>
W. Dally and C. L. Seitz.
 The torus routing chip.
 <em> J. Distributed Systems</em>, 1(3):187--196, 1986.
<P>
<DT><A NAME=Dally2><STRONG>71</STRONG></A><DD>
W. Dally and C. L. Seitz.
 Deadlock-free message routing in multiprocessor interconnection
  networks.
 <em> IEEE Trans. Computs.</em>, C-36(5):547--553, 1987.
<P>
<DT><A NAME=D92><STRONG>72</STRONG></A><DD>
W. J. Dally et al.
 The message-driven processor.
 <em> IEEE Micro.</em>, 12(2):23--39, 1992.
<P>
<DT><A NAME=Das1><STRONG>73</STRONG></A><DD>
C. R. Das, N. Deo, and S. Prasad.
 Parallel graph algorithms for hypercube computers.
 <em> Parallel Computing</em>, 13:143--158, 1990.
<P>
<DT><A NAME=Das2><STRONG>74</STRONG></A><DD>
C. R. Das, N. Deo, and S. Prasad.
 Two minimum spanning forest algorithms on fixed-size hypercube
  computers.
 <em> Parallel Computing</em>, 15:179--187, 1990.
<P>
<DT><A NAME=DeC89><STRONG>75</STRONG></A><DD>
A. L. DeCegama.
 <em> The Technology of Parallel Processing: Parallel Processing
  Architectures and VLSI Hardware: Volume 1</em>.
 Prentice-Hall, 1989.
<P>
<DT><A NAME=dC94><STRONG>76</STRONG></A><DD>
J. del Rosario and A. Choudhary.
 High-Performance I/O for Parallel Computers: Problems and
  Prospects.
 <em> Computer</em>, 27(3):59--68, 1994.
<P>
<DT><A NAME=DHvdV93><STRONG>77</STRONG></A><DD>
J. W. Demmel, M. T. Heath, and H. A. van der Vorst.
 Parallel numerical linear algebra.
 <em> Acta Numerica</em>, 10:111--197, 1993.
<P>
<DT><A NAME=DEH89><STRONG>78</STRONG></A><DD>
P. M. Dew, R. A. Earnshaw, and T. R. Heywood.
 <em> Parallel Processing for Computer Vision and Display</em>.
 Addison-Wesley, 1989.
<P>
<DT><A NAME=dewittpardbs><STRONG>79</STRONG></A><DD>
D. DeWitt and J. Gray.
 Parallel database systems: The future of high-performance database
  systems.
 <em> Commun. ACM</em>, 35(6):85--98, 1992.
<P>
<DT><A NAME=Dijkstra59><STRONG>80</STRONG></A><DD>
E. W. Dijkstra.
 A note on two problems in connexion with graphs.
 <em> Numerische Mathematik</em>, 1:269--271, 1959.
<P>
<DT><A NAME=DSG83><STRONG>81</STRONG></A><DD>
E. W. Dijkstra, W. H. J. Feijen, and A. J. M. V. Gasteren.
 Derivation of a termination detection algorithm for a distributed
  computation.
 <em> Information Processing Letters</em>, 16(5):217--219, 1983.
<P>
<DT><A NAME=Dong91><STRONG>82</STRONG></A><DD>
J. Dongarra, I. Duff, D. Sorensen, and H. van der Vorst.
 <em> Solving Linear Systems on Vector and Shared Memory Computers</em>.
 SIAM, 1991.
<P>
<DT><A NAME=Pozo><STRONG>83</STRONG></A><DD>
J. Dongarra, R. Pozo, and D. Walker.
 ScaLAPACK++: An object-oriented linear algebra library for scalable
  systems.
 In <em> Proc. Scalable Parallel Libraries Conf.</em>, pages 216--223.
  IEEE Computer Society, 1993.
<P>
<DT><A NAME=DvW94><STRONG>84</STRONG></A><DD>
J. Dongarra, R. van de Geign, and D. Walker.
 Scalability issues affecting the design of a dense linear algebra
  library.
 <em> J. Parallel and Distributed Computing</em>, 22(3):523--537, 1994.
<P>
<DT><A NAME=DW94><STRONG>85</STRONG></A><DD>
J. Dongarra and D. Walker.
 Software libraries for linear algebra computations on high
  performance computers.
 <em> SIAM Review</em>, 1995.
 to appear.
<P>
<DT><A NAME=Drake><STRONG>86</STRONG></A><DD>
J. Drake, I. Foster, J. Hack, J. Michalakes, B. Semeraro, B. Toonen,
  D. Williamson, and P. Worley.
 PCCM2: A GCM adapted for scalable parallel computers.
 In <em> Proc. 5th Symp. on Global Change Studies</em>, pages 91--98.
  American Meteorological Society, 1994.
<P>
<DT><A NAME=Dun90><STRONG>87</STRONG></A><DD>
R. Duncan.
 A survey of parallel computer architectures.
 <em> Computer</em>, 23(2):5--16, 1990.
<P>
<DT><A NAME=Dun92><STRONG>88</STRONG></A><DD>
R. Duncan.
 Parallel computer architectures.
 In <em> Advances in Computers</em>, volume 34, pages 113--152. Academic
  Press, 1992.
<P>
<DT><A NAME=EZL89><STRONG>89</STRONG></A><DD>
D. L. Eager, J. Zahorjan, and E. D. Lazowska.
 Speedup versus efficiency in parallel systems.
 <em> IEEE Trans. Computs.</em>, C-38(3):408--423, 1989.
<P>
<DT><A NAME=chimp1><STRONG>90</STRONG></A><DD>
Edinburgh Parallel Computing Centre, University of Edinburgh.
 <em> CHIMP Concepts</em>, 1991.
<P>
<DT><A NAME=chimp2><STRONG>91</STRONG></A><DD>
Edinburgh Parallel Computing Centre, University of Edinburgh.
 <em> CHIMP Version 1.0 Interface</em>, 1992.
<P>
<DT><A NAME=CPP><STRONG>92</STRONG></A><DD>
M. A. Ellis and B. Stroustrup.
 <em> The Annotated C++ Reference Manual</em>.
 Addison-Wesley, 1990.
<P>
<DT><A NAME=FUW><STRONG>93</STRONG></A><DD>
V. Faber, O. Lubeck, and A. White.
 Superlinear speedup of an efficient parallel algorithm is not
  possible.
 <em> Parallel Computing</em>, 3:259--260, 1986.
<P>
<DT><A NAME=Fen81><STRONG>94</STRONG></A><DD>
T. Y. Feng.
 A survey of interconnection networks.
 <em> IEEE Computer</em>, 14(12):12--27, 1981.
<P>
<DT><A NAME=Sisal><STRONG>95</STRONG></A><DD>
J. Feo, D. Cann, and R. Oldehoeft.
 A report on the SISAL language project.
 <em> J. Parallel and Distributed Computing</em>, 12(10):349--366, 1990.
<P>
<DT><A NAME=FK91><STRONG>96</STRONG></A><DD>
M. Feyereisen and R. Kendall.
 An efficient implementation of the Direct-SCF algorithm on
  parallel computer architectures.
 <em> Theoretica Chimica Acta</em>, 84:289--299, 1993.
<P>
<DT><A NAME=FK89><STRONG>97</STRONG></A><DD>
H. P. Flatt and K. Kennedy.
 Performance of parallel processors.
 <em> Parallel Computing</em>, 12(1):1--20, 1989.
<P>
<DT><A NAME=Floyd62><STRONG>98</STRONG></A><DD>
R. Floyd.
 Algorithm 97: Shortest path.
 <em> Commun. ACM</em>, 5(6):345, 1962.
<P>
<DT><A NAME=FW78><STRONG>99</STRONG></A><DD>
S. Fortune and J. Wyllie.
 Parallelism in random access machines.
 In <em> Proc. ACM Symp. on Theory of Computing</em>, pages 114--118.
  ACM, 1978.
<P>
<DT><A NAME=FPDT><STRONG>100</STRONG></A><DD>
I. Foster.
 Task parallelism and high performance languages.
 <em> IEEE Parallel and Distributed Technology</em>, 2(3):39--48, 1994.
<P>
<DT><A NAME=SHPCC><STRONG>101</STRONG></A><DD>
I. Foster, B. Avalani, A. Choudhary, and M. Xu.
 A compilation system that integrates High Performance Fortran
  and Fortran M.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  293--300. IEEE Computer Society, 1994.
<P>
<DT><A NAME=FM1><STRONG>102</STRONG></A><DD>
I. Foster and K. M. Chandy.
 Fortran M: A language for modular parallel programming.
 <em> J. Parallel and Distributed Computing</em>, 25(1), 1995.
<P>
<DT><A NAME=fosterclimate><STRONG>103</STRONG></A><DD>
I. Foster, M. Henderson, and R. Stevens.
 Data systems for parallel climate models.
 Technical Report ANL/MCS-TM-169, Mathematics and Computer Science
  Division, Argonne National Laboratory, Argonne, Ill., 1991.
<P>
<DT><A NAME=FKT><STRONG>104</STRONG></A><DD>
I. Foster, C. Kesselman, and S. Taylor.
 Concurrency: Simple concepts and powerful tools.
 <em> Computer J.</em>, 33(6):501--507, 1990.
<P>
<DT><A NAME=PCN2><STRONG>105</STRONG></A><DD>
I. Foster, R. Olson, and S. Tuecke.
 Productive parallel programming: The PCN approach.
 <em> Scientific Programming</em>, 1(1):51--66, 1992.
<P>
<DT><A NAME=FMManual><STRONG>106</STRONG></A><DD>
I. Foster, R. Olson, and S. Tuecke.
 Programming in Fortran M.
 Technical Report ANL-93/26, Mathematics and Computer Science
  Division, Argonne National Laboratory, Argonne, Ill., 1993.
<P>
<DT><A NAME=Strand><STRONG>107</STRONG></A><DD>
I. Foster and S. Taylor.
 <em> Strand: New Concepts in Parallel Programming</em>.
 Prentice-Hall, 1989.
<P>
<DT><A NAME=Tilson><STRONG>108</STRONG></A><DD>
I. Foster, J. Tilson, A. Wagner, R. Shepard, R. Harrison, R. Kendall, and
  R. Littlefield.
 High performance computational chemistry: (I) Scalable Fock
  matrix construction algorithms.
 Preprint, Mathematics and Computer Science Division, Argonne National
  Laboratory, Argonne, Ill., 1994.
<P>
<DT><A NAME=FosterToonen><STRONG>109</STRONG></A><DD>
I. Foster and B. Toonen.
 Load-balancing algorithms for climate models.
 In <em> Proc. 1994 Scalable High-Performance Computing Conf.</em>, pages
  674--681. IEEE Computer Society, 1994.
<P>
<DT><A NAME=FW><STRONG>110</STRONG></A><DD>
I. Foster and P. Worley.
 Parallel algorithms for the spectral transform method.
 Preprint MCS-P426-0494, Mathematics and Computer Science Division,
  Argonne National Laboratory, Argonne, Ill., 1994.
<P>
<DT><A NAME=Fox88><STRONG>111</STRONG></A><DD>
G. Fox et al.
 <em> Solving Problems on Concurrent Processors</em>.
 Prentice-Hall, 1988.
<P>
<DT><A NAME=FD><STRONG>112</STRONG></A><DD>
G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, and M. Wu.
 Fortran D language specification.
 Technical Report TR90-141, Dept. of Computer Science, Rice
  University, 1990.
<P>
<DT><A NAME=Fox94><STRONG>113</STRONG></A><DD>
G. Fox, R. Williams, and P. Messina.
 <em> Parallel Computing Works!</em>
 Morgan Kaufman, 1994.
<P>
<DT><A NAME=Frederickson><STRONG>114</STRONG></A><DD>
P. Frederickson, R. Hiromoto, T. Jordan, B. Smith, and T. Warnock.
 Pseudo-random trees in Monte Carlo.
 <em> Parallel Computing</em>, 1:175--180, 1984.
<P>
<DT><A NAME=FHH83><STRONG>115</STRONG></A><DD>
H. J. Fromm, U. Hercksen, U. Herzog, K. H. John, R. Klar, and W. Kleinoder.
 Experiences with performance measurement and modeling of a processor
  array.
 <em> IEEE Trans. Computs.</em>, C-32(1):15--31, 1983.
<P>
<DT><A NAME=GPS90><STRONG>116</STRONG></A><DD>
K. Gallivan, R. Plemmons, and A. Sameh.
 Parallel algorithms for dense linear algebra computations.
 <em> SIAM Review</em>, 32(1):54--135, 1990.
<P>
<DT><A NAME=GR88><STRONG>117</STRONG></A><DD>
N. Gehani and W. Roome.
 <em> The Concurrent C Programming Language</em>.
 Silicon Press, 1988.
<P>
<DT><A NAME=PICL><STRONG>118</STRONG></A><DD>
G. A. Geist, M. T. Heath, B. W. Peyton, and P. H. Worley.
 A user's guide to PICL: A portable instrumented communication
  library.
 Technical Report TM-11616, Oak Ridge National Laboratory,
  1990.
<P>
<DT><A NAME=GR90><STRONG>119</STRONG></A><DD>
A. Gibbons and W. Rytter.
 <em> Efficient Parallel Algorithms</em>.
 Cambridge University Press, 1990.
<P>
<DT><A NAME=gibsonbook><STRONG>120</STRONG></A><DD>
G. A. Gibson.
 <em> Redundant Disk Arrays: Reliable, Parallel Secondary Storage</em>.
 MIT Press, 1992.