Communications directed by bound types in Linda: presentation and formal model
Tóm tắt
Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model-Linda with bound types or B-Linda-suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.
Từ khóa
#Application software #Parallel programming #Associative memory #Concurrent computing #Distributed computing #Computer architecture #Parallel processing #Variable speed drives #Power system economics #Power generation economicsTài liệu tham khảo
shoenfielinger, 1995, WWW Meets Linda: Linda for Global WWW-Based Transaction Processing Systems, World Wide Web J
lehman, 1999, Tspaces: The Next Wave, Hawaii Int'l Conf System Sciences
carriero, 1990, How to Write Parallel Programs A First Course
jeong, 1994, Plinda 2.0: A Transactional/Checkpointing Approach to Fault Tolerant Linda
siegel, 1991, Implementing Distributed Linda in Standard ml
gibaud, 1999, Linda Typ�: Une Extension du Mod�le Linda Pour Environnement Multiapplicatif. [Typed Linda: An Extension of the Linda Model for Multiapplicative Environment], Technique et Science Informatiques (TSI), 19, 43
matson, 1992, The C-Linda Language for Network of Workstations
10.1016/S1389-1286(00)00178-X
minsky, 1995, Law-Governed Linda as a Coordination Model, Object-Based Models and Languages for Concurrent Systems, 125, 10.1007/3-540-59450-7_8
2000, Paradise User's Guide and Reference Manual
2000, JavaSpaces Service Specification
hupfer, 1990, Melinda: Linda with Multiple Tuple Spaces
gelernter, 1989, Multiple Tuple Spaces in Linda, Proc Parallel Architectures and Languages Europe (PARLE '89), 366, 20, 10.1007/3-540-51285-3_30
leichter, 1993, Shared Memories, Buses, and LansLinda Implementations Across the Spectrum of Connectivity
agha, 1993, Actorspaces: An Open Distributed Programming Paradigm, Proc Fourth ACM Conf Principles and Practice of Parallel Programming ACM SIGPLAN Notices, 28, 23
10.1016/0169-7552(96)00045-1
gelernter, 1985, Parallel Programming in Linda, Proc Int'l Conf Parallel Programming, 255
gibaud, 1996, Linda Typ� : Une Approche Plus S�re de la Programmation Distribu�e Avec Linda. [Typed Linda: A Safer Approach to Distributed Programming with Linda], Calculateurs Parall�les, 8, 365
plotkin, 1981, A Structural Approach to Operational Semantics
10.1109/2.44903
priami, 1996, Enhanced Operational Semantics for Concurrency
pinakis, 1993, Using Linda as the Basis of an Operating System Microkernel
bakken, 1993, Supporting Fault Tolerant Parallel Programming in Linda
ciancarini, 1992, The Semantics of a Parallel Language Based on a Shared Data Space