(Citer ici Parle'93)

unevenoliveSoftware and s/w Development

Dec 1, 2013 (3 years and 9 months ago)

73 views

1.

G. Akerholt, K. Hammond, S. Peyton
-
Jones, and P. Trinder.,



Processing transactions on
GRIP, a parallel graph reducer

”, In Bode et al.
(Citer ici Parle'93)
.

2.

M. Aldinucci, M. Coppola, and M. Danelutto.

Rewriting Skeleton Programs: How to Evaluate
the Data
-
Parallel Stream
-
Parallel Tradeof
,

In Gorlatch
(Citer ici cmpp98)
.

3.

K. Apt and R.E Olderog.

Verification of Sequential and Concurrent Programs
.
Springer
Verlag, 1997.

4.

Arvind and R. Nikhil.

I
-
structures: Data structures for parallel computing.

ACM
Transactions
on Programming Languages and Systems
,

11
(4), 1989.

5.

A. Asperti and C. Laneve.

Interactive systems: the theory of optimal reduction.

Mathematical
Structures in Computer Science
, 4:457

504, 1994.

6.

A. Asperti and G. Longo.

Categories, Types and St
ructures
.

MIT Press, 1991.

7.

O. Ballereau, F. Loulergue, and G. Hains.

High
-
level BSP Programming: BSML and BS

.

In
P. Trinder and G. Michaelson, editors,
Draft Proceedings of the fist Scottish Functional
Programming Workshop
, number Te
chinal Report RM/99/9, pages 43

52, Edinburgh, august
1999. Heriot
-
Watt University.

8.

H.P. Barendregt.

The Lambda Calculus, Its Syntax and Semantics
.

North
-
Holland, 1986.

9.

H.P. Barendregt
.

Lambda calculi with types
.

Oxford University Press, 1994.

10.

P. Barth, R. Nikhil, and Arvind.

M
-
structures: Extending a parallel, non
-
strict, functionnal
language with state.

In J. Hughes, editor,
FPCA'91
, number 523. Springer, 1991.

11.

G. Berry and P.
-
L. Curien.

Theory and practice of sequential algorithms: the kernel of the
applicative language CDS.

In J. C. Reynolds and M. Nivat, editors,
Algebraic Semantics
,
pages 35

84. Cambridge University Press, 1985.

12.

G.E. Blelloch.

NESL: A Nested Data
-
Parallel Language (version 2.6)
.

Technical Report
CMU
-
CS
-
93
-
129, School of Computer Science, Carnegie Mellon University, April 1993.

13.

A. Bode, M. Reeve, and G. Wolf, editors.

PARLE'93, Paral
lel Architectures and Languages
Europe
, number 694 in Lecture Notes in Computer Science, Munich, June 1993. Springer.

14.

O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping.

The Paderborn University BSP (PUB)
Library
-

Design, Implementat
ion and Performance
.
In
Proc. of 13th International Parallel
Processing Symposium & 10th Symposium on Parallel and Distributed Processing
(IPPS/SPDP)
, San
-
Juan, Puerto
-
Rico, April 1999.

15.

G.
-
H. Botorog and H. Kuchen.

Efficient para
llel programming with algorithmic skeletons.

In
Bougé et al.
(Citer ici Europar'96)
.

16.

G.
-
H. Botorog and H. Kuchen.

Efficient high
-
level parallel programming.

Theoretical
Computer Science
, 196:71

107, 1998.

17.

L. Bougé.

Le

modèle de programmation à parallélisme de données: une perspective
sémantique.

Technique et Science Informatiques
, 12(5), 1993.

18.

L. Bougé, D. Cachera, Y. Le Guyadec, G. Utard, and B. Virot.

Formal Validation of
Data

Pa
rallel Programs: a Two

Component Assertional Proof System for a Simple Language
.
Theoretical Computer Science
, 189(1
-
2):71

107, 1997.

19.

L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors.

Euro
-
Par'96

Parallel Processing
,

nu
mber 1123

1124 in Lecture Notes in Computer Science, Lyon
,

August 1996. LIP
-
ENSL,
Springer.

20.

S. Brookes and S. Geva.

Computational comonads and intensional semantics.

In M. P.
Fourman, P. T. Johnstone, and A. M. Pitts, editors,
Ap
plications of Categories in Computer
Science
, number 177 in London Mathematical Society Lecture Note Series, Durham, 1991.
Cambridge University Press.

Proceedings of the LMS Symposium.

21.

S. Brookes and S. Geva.

Continuous functio
ns and parallel algorithms on concrete data
structures.

In
MFPS'91
, L.N.C.S.

Springer, 1991.

22.

R. Calinescu.

Bulk synchronous parallel scheduling of uniform dags.

In Luc Bouge et al.,
editors,
Euro
-
Par'96. Parallel Processing
, volume 2 of Lecture Notes in Computer Science
1124
,

pages 555

562. Springer
-
Verlag, 1996.

23.

R. Cartwright, P.
-
L. Curien, and M. Felleisen.

Fully abstract semantics for observably
sequential l
anguages.

Information and Computation
, 111(2):297

401, 1994.

24.

E. Chailloux and C. Foisy.

Caml
-
Flight

alpha: Implantation et applications.

In Queinnec et al.
(Citer ici jfla95)
.

25.

M. M. T. Chakr
avarty, F. W. Schröer, and M. Simons.

V


nested parallelism in C.

In W. K.
Giloi, S. Jähnichen, and B. D. Shriver, editors,
Proceedings of Programming Models for
Massively Parallel Computers 1995
, pages 167

174, Berlin, 1996. IEEE Computer Society
Press.

26.

M. Chen, Y.
-
Il Choo, and J. Li.

Crystal: Theory and pragmatics of generating efficient parallel
code.

In B. K. Szymanski, editor,
Parallel Functional Languages and Compilers
. ACMPress,
1991.

27.

M. Cole.

Algorithmic Sk
eletons: Structured Management of Parallel Computation
.

MITPress,
1989.

28.

G. Cousineau and M. Mauny.

The Functional Approach to Programming
.

Cambridge
University Press, 1998.

29.

D. E. Culler, R.
M. Karp, David A. Patterson, A. Sahey, K. E. Schauser, E. Santos, R.
Subramonian, and T. von Eicken.

LogP: towards a realistic model of parallel computation.

ACMSIG
PLANNotices
,

28(7):1

12, July 1993.

30.

P.
-
L. Curien.

Categorical Combi
nators, Sequential Algorithms and Functional Programming
.

Birkhäuser, Boston, second edition, 1993.

31.

M. Danelutto, R. Di Cosmo, X. Leroy, and S. Pelagatti.

Ocamlp3l a functional parallel
programming system.

Liens
-
98
-
1, ENS, 1998.

32.

J. Darlington, A. J. Field, P. G. Harrison, P. Kelly, D. Sharp, Q. Wu, and R. While.

Parallel
programming using skeleton functions.

In Bode et al.
(Citer ici Parle'93)
.

33.

J. Darlington, Y.KGuo, H.W. To, and Y. Jing.

Skeletons for structured parallel composition.

In
Proceedings of the 15th ACMSIGPLANSymposium on Principles and Practice of Parallel
Programming
, 1995.

34.

M. Devin.

Le langage CDS: description,

implémentation, compilation
.

Thèse de docteur
ingénieur, Université de Paris VII, 1984.

35.

C. Foisy.

Machine abstraite catégorique et programmation data
-
parallèle
.

Thèse de doctorat,
Université de Montréal, DIRO, 1995.

36.

C. Foisy and E. Chailloux.

Caml Flight: a portable SPMD extension of ML for distributed
memory multiprocessors.

In A. W. Böhm and J. T. Feo, editors,
Workshop on High
Performance Functionnal Computing
, Denver, Colorado, April 1995. Lawrence Livermore
National Laboratory, USA.

37.

C. Foisy, J. Vachon, and G. Hains.

DPML:

de la sémantique à l'implantation.

In P. Cointe, C.
Queinnec, and B. Serpette, editors, DPML:

de la Sémantique à l'Implantation
,

volume 11 of
Collection

Didactique
,

Noirm
outier, Février 1994. INRIA.

38.

I. Foster.

High
-
performance distributed computing: The I
-
WAY experiment and beyond.

In
Bougé et al.
(Citer ici Europar'96)
.

39.

A. V. Gerbessiotis and L. G. Valiant.

Dir
ect bulk
-
synchronous parallel algorithms.

Journal of
Parallel and Distributed Computing
, 22:251

267, 1994.

Long version of Gerbessiotis1992.

40.

J.
-
L. Giavitto and J.
-
P. Sansonnet.

8 et 1/2 data
-
parallélisme et data
-
flow.

Technique

et Science
Informatiques
, 12(5), 1993.

Numéro

spécial sur les langages à parallélisme de données.

41.

S. Gorlatch.

Systematic efficient parallelization of scan and other list homomorphisms.

In
Bougé et al.
(Citer ici Europar'96)
.

42.

S. Gorlatch, editor.

First

International

Workshop

on
Constructive

Methods

for
Parallel

Programming

(
CMPP'98
)
,

Research Report MIP
-
9805. University of Passau, May 1998.

43.

C. A. Gunter and D. S. Scott.

Semantic domains.

In J. Van Leeuwen, editor,
Handbook of
Theoretical Computer Science
. North
-
Holland, MIT
-
Press, 1990.

44.

G. Hains.

Parallel functional languages should be strict.

In B. Pehrson and I. Simon, editors,
Workshop on General Purpo
se Parallel Computing. World Computer Congress
, volume 1,
pages 527

532, Hamburg, September 1994. IFIP, North
-
Holland.

45.

G. Hains.

Subset synchronization in BSP computing.

In H.RArabnia, editor,
PDPTA'98,
International Conference on Parall
el and Distributed Processing Techniques and
Applications
, volume 1, pages 242

246, Las Vegas, July 1998. CSREAPress.

46.

G. Hains and C. Foisy.

The data
-
parallel categorical abstract machine.

In A. Bode, M. Reeve,
and G. Wolf, editors,
PARL
E'93, Parallel Architectures and Languages Europe
, number 694
in Lecture Notes in Computer Science, pages 56

67, Munich, June 1993. Springer.

47.

G. Hains, F. Loulergue, and J. Mullins.

Concrete data structures and functional parallel
progra
mming.

Theoretical Computer Science
, Accepted for publication.

48.

G. Hains and J. Mullins.

Array structures and data
-
parallel algorithms.

Research Note
RR
-
95
-
1E, ISIS, Fujitsu Labs
,

Makuhari, Japan
,

1995.

49.

G. Hains
and J. Mullins.

Array structures and data
-
parallel algorithms.

In Bougé, Fraigniaud,
Mignotte, and Robert, editors,
EURO
-
PAR'96
, number 1124 in Lecture Notes in Computer
Science, pages 409

416, Lyon, 1996. LIP
-
ENSL, Springer.

50.

C. A. R.

Hoare.

Communicating Sequential Processes
.

Prentice
-
Hall, 1985.

51.

P. Hudak.

Para
-
functional programming.

In B. K. Szymanski, editor,
Parallel Functional
Languages and Compilers
. ACM Press, 1991.

52.

J. JáJá.

An Introduction to Parallel Algorithms
.

Addison
-
Wesley, 1992.

53.

C.B. Jay, M.I. Cole, M. Sekanina, and P. Steckler.

Amonadic calculus for parallel costing of a
functional language of arrays.

In
Euro
-
Par'97
, number 1300 in LNCS. Springer, 199
7.

54.

H. Jifeng, Q. Miller, and L. Chen.

Algebraic laws for BSP programming.

In Bougé et al.
(Citer ici Europar'96)
.

55.

J.M.D.Hill, W.F.McColl, D.C.Stefanescu, M. W. Goudreau, K. Lang, S. B. Rao, T.Suel,
T.Tsantilas,

and R. Bisseling.

BSPlib
,

the BSP programming library.

Technical report, BSP
Worldwide, May 1997.

http://www.bsp
-
worldwide.org/

56.

G. Jones.

Programming in Occam
.

Prentice
-
Hall, 1987.

57.

G. Kahn and G.D.Plotkin.

Concret
e domains.

Theoretical Computer Science
, 121:187

277,
1993.

58.

Z.O. Khasidashvili.

Expression reduction systems.

In
Proceedings of I. Vekua Institute of
Applied Mathematics
, volume 36, pages 200

220, 1990.

59.

J.W. Klop, Vincent va
n Oostrom, and F. van Raamsdonk.

Combinatory reduction systems:
introduction and survey.

Theoretical Computer Science
, 121:279

308, 1993.

60.

P. Krishnan.

Distributed CCS.

In
Theories of Concurrency: Unification and Extension:
CONCUR
-
91, LNCS:527
, pages 393

407. Springer
-
Verlag, August 1991.

61.

X. Leroy.

The Objective Caml

system, documentation and user's guide.

Technical report,
INRIA, 1998.

http://pauillac.
inria.fr/caml
.

62.

B. Lisper.

Data parallelism and functional programming.

In
école

de Printemps sur le
Data
-
Parallélisme
,

Les Menuires, France
,

1996. PRC
-
CNRS, Springer.

63.

F. Loulergue.

Extension du BS

-
calcul
.
In P. Weis, editor,
JFLA'99 : Journées Francophones
des Langages Applicatifs
, pages 93

112, Morzine
-
Avoriaz, February 1999.

64.

F. Loulergue and G. Hains.

Parallel functional programming with explicit processes: Beyond
SPMD
.

In C. Lengauer
,

M. Griebl
,

and S. Gorlatch
,

editors,
Euro
-
Par'97 Parallel Processing
,
number 1300 in Lecture Notes in Computer Science, pages 530

537, Passau, Germany,
August 1997. Springer
.

65.

F. Loulergue and G. Hains.

Programmation
fonctionnelle parallèle en processus statiques: Une
approche dénotationnelle.

In
Journées

Francophones des Langages Applicatifs
JFLA'97
.

INRIA, Janvier 1997.

66.

F. Loulergue, G. Hains, and C. Foisy.

A Calculus of Functional BSP Programs
.
Science

of
Computer Programming
.

To Appear.

67.

F. Loulergue, G. Hains, and C. Foisy.

A Calculus of Recursive
-
Parallel BSP Programs
.
In
Gorlatch
(Citer ici cmpp98)
, pages 59

70.

68.

J. Mallet.

Compilation d'un lan
gage spécialisé pour machine massivement parallèle
.

thèse de
doctorat, Université de Rennes I, 1998.

69.

J. Mallet.

Symbolic cost analysis and automatic data distribution for a skeleton
-
based
language.

In Springer Verlage, edi
tor, Europar'98
,

number 1470 in LNCS, pages 688

697,
1998.

70.

R. Mayr and T. Nipkow.

Higher
-
order rewrite systems and their confluence.

Theoretical
Computer Science
, 192(1):3

29, February 1998.

71.

W.F. McColl.

Universal computing.

In Bougé et al.
(Citer ici Europar'96)
.

72.

L. Meertens.

Constructing a calculus of programs.

In van de Snepscheut, editor,
Mathematics
of Program Construction
, number 375 in Lecture Notes in Comput
er Science, Groningen, June

1989. Springer
.

73.

E. Melin, B. Raffin, X. Rebeuf, and B. Virot.

A Structured Synchronization and
Communication Model Fitting Irregular Data Accesses
.
Journal of Parallel and Distributed
Computin
g
, 50:3

27, 1998.

74.

R. Mirani and P. Hudak.

First
-
class schedules and virtual maps.

In 7
th

Annual Conference on
Functional Programming Languages and Computer Architectures
,

La Jolla, California, 1995.
ACM Press.

75.

T. Nipkow.

Orthogonal higher
-
order rewrite systems are confluent.

Lecture Notes in Computer
Science
, 664, 1993.

76.

Tobias Nipkow.

Higher
-
order critical pairs.

In G. Kahn, editor, Sixth Annual IEEE
Symposium on Logic in
Computer Science
,

pages 342

349, Amsterdam, The Netherlands,
July 1991.

77.

C. Okasaki.

Purely Functional Data
-
Structures
.
Cambridge University Press, 1998.

78.

P. Panangaden and J. Reppy.

The essence

of concurrent ML.

In F. Nielson, editor,
ML
with
Concurrency
,

Monographs in Computer Science. Springer, 1996.

79.

S. Pelagatti.

Structured Development of Parallel Programs
.

Taylor & Francis, 1997.

80.

S. L. Peyton
-
Jones.

Mise en Oeuvre des Langages Fonctionnels de Programmation
.

Masson,
1990.

Traduction de
Implementation of Functional Programming Languages
, (Prentice
-
Hall
1987).

81.

C. Queinnec, V. V. Donzeau
-
Gouge, and P. Weis, editors.

Journées Francophones des
Langages Applicatifs JFLA
,

number 13 in Collection Didactique. INRIA, Janvier 1995.

82.

E. Rahm.

Dynamic load balancing in parallel database systems.

In Bougé et al.
(Citer ici
Europar'96)
.

83.

J. Se
rot.

Embodying Parallel Functional Skeletons: An Experimental Implementation on Top
of MPI.

In C. Lengauer
,

M. Griebl
,

and S. Gorlatch
,

editors,
Euro
-
Par'97

Parallel Processing
,

number 1300 in Lecture Notes in Computer Science, pages 629

633, Passau, Germa
ny,
August 1997. Springer
.

84.

D. B. Skillicorn.

Foundations of Parallel Programming
.

Number 6 in International Series on
Parallel Computation. Cambridge University Press, 1994.

85.

D. B. Sk
illicorn, M. Danelutto, S. Pelagatti, and A. Zavanella.

Optimising data
-
parallel
programs using the BSP cost model.

In Europar'98
,

volume 1470 of Lecture Notes in
Computer Science
,

pages 698

715. Springer Verlag, 1998.

86.

M. Snir and W. Gropp.

MPI the Complete Reference
.

MIT Press, 1998.

87.

G.H. Steele and W.D. Hillis.

Connection Machine Lisp: A Fine Grained Parallel Symbolic
Processing Language
.
In
ACM Conf. on Lisp and Funct. Progr.
, pages 276

297, Cambridge
MA, 1986.

88.

J.
-
P. Talpin.

Aspects Théoriques et Pratiques de l'Inférence de Type et d'Effets
.
Thèse de
doctorat, Université Paris VI, école Nationale Supérieure des Mines de Paris, Mai 1993.

Rapport Technique no. EMP/CRI/A
-
236
.

89.

Alexandre Tiskin.

The bulk
-
synchronous parallel random access machine.

Theoretical
Computer Science
, 196(1

2):109

130, 6 April 1998.

90.

J. Vachon.

Une

analyse statique pour le contrôle des effets de bords en Caml
-
Flight

beta.

In
Queinnec et al.
(Citer ici jfla95)
.

91.

Leslie G Valiant.

Abridging model for parallel computation.

Communications of the ACM
,
33(8):103, August 1990.

92.

V. van Oostrom and F. van Raamsdonk.

Comparing combinatory reduction systems and
higher
-
order rewrite systems.

In
Higher
-
Order Algebra, Logic and Term Rewriting
, volume
816 of LNCS, pages 276

304. Springer, 1994.

93.

F.
van Raamsdonk.

Confluence and Normalisation for Higher
-
Order Rewriting
.

PhDthesis,
Vrije Universiteit Amsterdam, 1996.

94.

E. Violard and G.
-
R. Perrin.

PEI: A language and its refinement calculus for parallel
programming.

Parallel Com
puting
, 18(10):1167

1184, October 1992.

95.

E. Violard and G.
-
R. Perrin.

PEI: a single unifying model to design parallel programs.

In Bode
et al.
(Citer ici Parle'93)
.

96.

G. Winskel.

Event structures.

Number 255

in Lecture

Notes in Computer Science, pages
325

392. Springer, 1987.