GLORIA

GEOMAR Library Ocean Research Information Access

X

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Larus, James R.  (3)
  • 1990-1994  (3)
Material
Publisher
Person/Organisation
Language
Years
  • 1990-1994  (3)
Year
Subjects(RVK)
  • 1
    Online Resource
    Online Resource
    Where is time spent in message-passing and shared-memory programs?
    Association for Computing Machinery (ACM) ; 1994
    In:  ACM SIGPLAN Notices Vol. 29, No. 11 ( 1994-11), p. 61-73
    Details
    In: ACM SIGPLAN Notices, Association for Computing Machinery (ACM), Vol. 29, No. 11 ( 1994-11), p. 61-73
    Abstract: Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory programs running on similar hardware. To ensure that our measurements are comparable, we produced two carefully tuned versions of each program and measured them on closely-related simulators of a message-passing and a shared-memory machine, both of which are based on same underlying hardware assumptions. We examined the behavior and performance of each program carefully. Although the cost of computation in each pair of programs was similar, synchronization and communication differed greatly. We found that message-passing's advantage over shared-memory is not clear-cut. Three of the four shared-memory programs ran at roughly the same speed as their message-passing equivalent, even though their communication patterns were different.
    Type of Medium: Online Resource
    ISSN: 0362-1340 , 1558-1160
    URL: Article
    DOI: 10.1145/195470.195501
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1994
    detail.hit.zdb_id: 2079194-X
    detail.hit.zdb_id: 282422-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 2
    Online Resource
    Online Resource
    Mechanisms for cooperative shared memory
    Association for Computing Machinery (ACM) ; 1993
    In:  ACM SIGARCH Computer Architecture News Vol. 21, No. 2 ( 1993-05), p. 156-167
    Details
    In: ACM SIGARCH Computer Architecture News, Association for Computing Machinery (ACM), Vol. 21, No. 2 ( 1993-05), p. 156-167
    Abstract: This paper explores the complexity of implementing directory protocols by examining their mechanisms primitive operations on directories, caches, and network interfaces. We compare the following protocols: Dir 1 B , Dir 4 B , Dir 4 NB , Dir n NB [2], Dir 1 SW [9] and an improved version of Dir 1 SW ( Dir 1 SW + ). The comparison shows that the mechanisms and mechanism sequencing of Dir 1 SW and Dir 1 SW + are simpler than those for other protocols. We also compare protocol performance by running eight benchmarks on 32 processor systems. Simulations show that Dir 1 SW + s performance is comparable to more complex directory protocols. The significant disparity in hardware complexity and the small difference in performance argue that Dir 1 SW + may be a more effective use of resources. The small performance difference is attributable to two factors: the low degree of sharing in the benchmarks and Check- In/Check-Out (CICO) directives [9].
    Type of Medium: Online Resource
    ISSN: 0163-5964
    URL: Article
    DOI: 10.1145/173682.165151
    RVK:
    SS 1985
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1993
    detail.hit.zdb_id: 2088489-8
    detail.hit.zdb_id: 186012-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
  • 3
    Online Resource
    Online Resource
    Where is time spent in message-passing and shared-memory programs?
    Association for Computing Machinery (ACM) ; 1994
    In:  ACM SIGOPS Operating Systems Review Vol. 28, No. 5 ( 1994-12), p. 61-73
    Details
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 28, No. 5 ( 1994-12), p. 61-73
    Abstract: Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory programs running on similar hardware. To ensure that our measurements are comparable, we produced two carefully tuned versions of each program and measured them on closely-related simulators of a message-passing and a shared-memory machine, both of which are based on same underlying hardware assumptions. We examined the behavior and performance of each program carefully. Although the cost of computation in each pair of programs was similar, synchronization and communication differed greatly. We found that message-passing's advantage over shared-memory is not clear-cut. Three of the four shared-memory programs ran at roughly the same speed as their message-passing equivalent, even though their communication patterns were different.
    Type of Medium: Online Resource
    ISSN: 0163-5980
    URL: Article
    DOI: 10.1145/381792.195501
    RVK:
    S418
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1994
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Online Resource
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...