Change search
ReferencesLink to record
Permanent link

Direct link
Synchronizing communication primitives for a shared memory programming model
KTH, Superseded Departments, Teleinformatics.
KTH, Superseded Departments, Teleinformatics.
1998 (English)In: Euro-Par’98 Parallel Processing / [ed] David Pritchard and Jeff Reeve, Berlin: Springer Berlin/Heidelberg, 1998, 682-687 p.Conference paper (Refereed)
Abstract [en]

In this  article  we concentrate on semantics  of operations  on synchronizing  shared  memory  that  provide  useful  primitives  for shared memory access  and update.  The  operations  are  a  part  of a  new  shared- memory  programming  model  called  mEDA.  The  main  goal  of  this  re- search  is  to  provide  a  flexible,   effective  and  relatively  simple  model of inter-process  communication  and  synchronization  via  synchronizing shared  memory.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 1998. 682-687 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 1470
Keyword [en]
National Category
Computer Science
URN: urn:nbn:se:kth:diva-53217DOI: 10.1007/BFb0057916ISI: 000082482800082ISBN: 978-3-540-64952-6OAI: diva2:469361
4th International Euro-Par Conference. Southampton, UK. September 1–4, 1998
QC 20120104Available from: 2011-12-23 Created: 2011-12-23 Last updated: 2012-01-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Vlassov, VladimirThorelli, Lars-Erik
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link