Matching language and hardware for parallel computation in the Linda Machine

Ahuja, S. R.; Carriero, Nicholas; Gelernter, David; Krishnaswamy, V.

doi:10.1109/12.2244

Cited by 45 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More precisely, we want to control when and for how long a failure should occur on each node. 1 For this reason, we extended our benchmark application by adding a set of special operations for starting and ending a kernel's failure.…”

Section: Set-up Of the Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

An experimental evaluation of self-managing availability in shared data spaces

Russello

Chaudron

Steen

et al. 2007

Science of Computer Programming

View full text Add to dashboard Cite

With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However, as in many distributed applications, functional and extra-functional aspects are still interwoven in components. In this paper, we address how shared data spaces can support the separation of concerns. In particular, we present a solution that allows developers to merely specify availability requirements for data tuples, while the underlying middleware evaluates various distribution and replication policies in order to select the one that meets these requirements best. Moreover, in our approach, the middleware continuously monitors the behavior of application and system components, and switches to different policies if this would lead to better results. We describe our approach, along with the design of a prototype implementation and its quantitative evaluation.

show abstract

Section: Set-up Of the Experimentsmentioning

confidence: 99%

“…There has been much research on how to optimize the distribution and replication of tuples for parallel applications. A generic approach that balances the broadcasting of read and write operations is described in [1] and exemplifies tuple spaces for parallel applications.…”

Section: Related Workmentioning

confidence: 99%

An experimental evaluation of self-managing availability in shared data spaces

Russello

Chaudron

Steen

et al. 2007

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…However, update propagation in such systems (typically supported either by invalidate and resend on access or by RMI-style mechanisms) are inefficient (re-sending a large object or a log of operations (RMI)) and often infeasible 1 for data mining applications. Distributed shared memory systems [3,5,26,35,33,20,22,43] all support transparent sharing of data amongst remote processes, with efficient update propagation, but most require tight coupling of processes with sharing that is not address-independent. None of the above systems support flexible client-controlled coherence, client-controlled memory placement (due to their address-dependent nature), or anytime updates.…”

Section: Related Workmentioning

confidence: 99%

Shared State for Client-Server Mining

Parthasarathy¹,

Dwarkadas²

2001

Proceedings of the 2001 SIAM International Conference on Data Mining

View full text Add to dashboard Cite

“…Linda 1], which is the most important example of this kind of language, provides the abstraction of a shared, content-addressable memory that can be accessed by a n y process. While Linda is architecture independent, and thus holds those characteristics of high-levelness that facilitate the parallel programming job and the portability of programs, the tuning of each Linda application for each speci c target machine is the responsibility o f t h e programmer.…”

Section: Related Workmentioning

confidence: 99%

P³L: A structured high‐level parallel language, and its structured support

Bacci

Danelutto

Orlando

et al. 1995

Concurrency: Pract. Exper.

134

View full text Add to dashboard Cite

This paper presents a parallel programming methodology that ensures easy programming, e ciency, and portability of programs to di erent m a c hines belonging to the class of the generalpurpose, distributed memory, MIMD architectures. The methodology is based on the de nition of a new, high-level, explicitly parallel language, called P 3 L, and of a set of static tools that automatically adapt the program features for each target architecture. P 3 L does not require programmers to specify process activations, the actual parallelism degree, scheduling, or interprocess communications, i.e. all those features that need to be adjusted to harness each speci c target machine. Parallelism is, on the other hand, expressed in a structured and qualitative w ay, b y hierarchical composition of a restricted set of language constructs, corresponding to those forms of parallelism that are frequently encountered in parallel applications, and that can e ciently be implemented.The e cient portability o f P 3 L applications is guaranteed by the compiler along with the novel structure of the support. The compiler automatically adapts the program features for each speci c architecture, accessing the costs (in terms of performance) of the low-level mechanisms exported by t h e a r c hitecture itself. In our methodology, these costs, along with other features of the architecture, are viewed through an abstract machine, whose mechanism interface is used by the compiler to produce the nal object code.1

show abstract

Matching language and hardware for parallel computation in the Linda Machine

Cited by 45 publications

References 15 publications

An experimental evaluation of self-managing availability in shared data spaces

An experimental evaluation of self-managing availability in shared data spaces

Shared State for Client-Server Mining

P³L: A structured high‐level parallel language, and its structured support

Contact Info

Product

Resources

About

Matching language and hardware for parallel computation in the Linda Machine

Cited by 45 publications

References 15 publications

An experimental evaluation of self-managing availability in shared data spaces

An experimental evaluation of self-managing availability in shared data spaces

Shared State for Client-Server Mining

P3L: A structured high‐level parallel language, and its structured support

Contact Info

Product

Resources

About

P³L: A structured high‐level parallel language, and its structured support