article · 2001

Programming Shared Address Space Platforms

Cited by 0Abstract and details only

Abstract

Explicit parallel programming requires specification of parallel tasks along with their interactions. These interactions may be in the form of synchronization or communication of intermediate results. In shared address space architectures, communication is implicitly specified since some (or all) of the memory is accessible to all the processors. Consequently, programming paradigms for shared address space machines support constructs for expressing concurrency and synchronization along with techniques for minimizing associated overheads. In this chapter, we will discuss shared-address-space programming paradigms along with their performance aspects and related extensions to directive-based languages. As we briefly discussed in Chapter??, shared address space programming paradigms can vary widely on issues of data sharing, concurrency models, and support for synchronization. Process based models assume that all data associated with a process is private by default unless otherwise specified. While this is important for ensuring protection in multiuser systems, it is not necessary when multiple concurrent aggregates are cooperating to solve the same problem. The overheads associated with enforcing protection domains make processes less suitable for parallel programming. In contrast, lightweight processes and threads assume that all memory is global. By relaxing the protection domain, lightweight processes and threads support much faster manipulation. As a result, this is the preferred programming model for parallel programming and will be discussed extensively in this chapter. Directive based programming models extend the threaded model by facilitating creation and synchronization of threads. In this chapter, we study various aspects of programming using threads and parallel directives.

Cite this paper

APA 7

(2001). Programming Shared Address Space Platforms.

MLA 9

“Programming Shared Address Space Platforms.” 2001.

Chicago

2001. “Programming Shared Address Space Platforms.”

Harvard

(2001) ‘Programming Shared Address Space Platforms’.

BibTeX

@article{anon2001programming,
  title = {{Programming Shared Address Space Platforms}},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.