Accession Number:

ADA289883

Title:

Scalability of Atomic Primitives on Distributed Shared Memory Multiprocessors.

Descriptive Note:

Technical rept.,

Corporate Author:

ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Michael, Maged M.
• Scott, Michael L.

Report Date:

1994-07-01

Pagination or Media Count:

20.0

Abstract:

Many hardware primitives have been proposed for synchronization and atomic memory update on shared-memory multiprocessors. In this paper, we focus on general-purpose primitives that have proven popular on small-scale bus-based machines, but have yet to become widely available on large-scale, distributed-memory machines. Specifically, we propose several alternative implementations of fetch and Phi compare and swap, and load inkedstore-conditional. We then analyze the performance of these implementations for various data sharing patterns, in both real and synthetic applications. Our results indicate that good overall performance can be obtained by implementing compare and swap in a multiprocessors cache controllers, and by providing an additional instruction to load an exclusive copy of a line. AN

Descriptors:

• *DISTRIBUTED DATA PROCESSING
• *MULTIPROCESSORS
• ALGORITHMS
• COMPUTERIZED SIMULATION
• CONTROL SYSTEMS
• DATA MANAGEMENT
• COMPUTER COMMUNICATIONS
• EXPERIMENTAL DESIGN
• COMPUTER ARCHITECTURE
• INPUT OUTPUT PROCESSING
• CONCURRENT ENGINEERING
• RANDOM ACCESS COMPUTER STORAGE
• INSTRUCTIONS
• DATA LINKS
• TIME SHARING
• READ ONLY MEMORIES
• FAULT TOLERANT COMPUTING
• BINARY PROCESSORS
• BUBBLE MEMORIES

Subject Categories:

• Computer Hardware
• Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE