1988
DOI: 10.1109/2.15
|View full text |Cite
|
Sign up to set email alerts
|

Synchronization, coherence, and event ordering in multiprocessors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
49
0
2

Year Published

1990
1990
2003
2003

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 173 publications
(52 citation statements)
references
References 12 publications
1
49
0
2
Order By: Relevance
“…Permitting this indeterminacy improves the performance of the system (e.g., one process can be executed while another waits for data to be input) but can cause problems when the processes must share data or resources. System designers must therefore provide mechanisms that restrict the possible orderings of the instructions by synchronizing the processes (that is, ensuring that particular instructions from different streams are executed at the same time) (Dubois, et al, 1988).…”
Section: Managing Simultaneity Constraintsmentioning
confidence: 99%
“…Permitting this indeterminacy improves the performance of the system (e.g., one process can be executed while another waits for data to be input) but can cause problems when the processes must share data or resources. System designers must therefore provide mechanisms that restrict the possible orderings of the instructions by synchronizing the processes (that is, ensuring that particular instructions from different streams are executed at the same time) (Dubois, et al, 1988).…”
Section: Managing Simultaneity Constraintsmentioning
confidence: 99%
“…In multicast traffic, a source port simultaneously sends the same cell to many destination ports. Synchronization traffic occurs in distributed applications 19 where a software program is partitioned into a set of cooperating processes that run concurrently on different processors and communicate using message-passing over the interconnection network. Unless properly handled, synchronization traffic can lead to "hot-spot" network congestion 20 as described in the following example.…”
Section: Application Requirementsmentioning
confidence: 99%
“…The first emulator that we have developed is a system with hardware-enforced cache-coherence under strong or weak ordering of memory accesses [6]. The protocol is directory-based and each memory block has a home node where a directory records the presence and state of copies in every cache [11] [14].…”
Section: Emulation Of Cc-numas With Central Directory Protocolmentioning
confidence: 99%
“…If the store misses in the first-level cache no block is allocated (no allocation on store misses). Under strong ordering of memory accesses [6] (enforcing sequential consistency), the first-level cache and the processor block on each write access which misses or which requires coherence activity in the second-level cache. Under weak ordering of memory accesses there can be a write buffer between the first-and second-level caches (first-level write buffer) and between the second-level cache and the internal bus (second-level write buffer).…”
Section: Emulation Of Cc-numas With Central Directory Protocolmentioning
confidence: 99%
See 1 more Smart Citation