Look-ahead memory consistency model

Chao Chin Wu, Der Lin Pean, Cheng Chen

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

In this paper, we propose a hardware-centric look-ahead memory consistency model that makes the data consistent according to the special ordering requirement of memory accesses for critical sections. The novel model imposes fewer restrictions on event ordering than previously proposed models thus offering the potential of higher performance. The architecture has the following features: (1) blocking and waking up processes by hardware, (2) allowing instructions to be executed out-of-order, (3) until having acquired the lock can the processor allow the requests for accessing the protected data to be evicted to the memory subsystem. The advantages of the look-ahead model include: (1) more program segments are allowed parallel execution, (2) locks can be released earlier, resulting in reduced waiting times for acquiring lock, and (3) less network traffic because more write requests are merged by using two write caches.

Original languageEnglish
Pages504-510
Number of pages7
Publication statusPublished - 1998 Dec 1
EventProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS - Tainan, China
Duration: 1998 Dec 141998 Dec 16

Other

OtherProceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS
CityTainan, China
Period98-12-1498-12-16

Fingerprint

Data storage equipment
Computer hardware
Hardware

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Wu, C. C., Pean, D. L., & Chen, C. (1998). Look-ahead memory consistency model. 504-510. Paper presented at Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, .
Wu, Chao Chin ; Pean, Der Lin ; Chen, Cheng. / Look-ahead memory consistency model. Paper presented at Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, .7 p.
@conference{e9b7a307e26b41769a7b706907a143e2,
title = "Look-ahead memory consistency model",
abstract = "In this paper, we propose a hardware-centric look-ahead memory consistency model that makes the data consistent according to the special ordering requirement of memory accesses for critical sections. The novel model imposes fewer restrictions on event ordering than previously proposed models thus offering the potential of higher performance. The architecture has the following features: (1) blocking and waking up processes by hardware, (2) allowing instructions to be executed out-of-order, (3) until having acquired the lock can the processor allow the requests for accessing the protected data to be evicted to the memory subsystem. The advantages of the look-ahead model include: (1) more program segments are allowed parallel execution, (2) locks can be released earlier, resulting in reduced waiting times for acquiring lock, and (3) less network traffic because more write requests are merged by using two write caches.",
author = "Wu, {Chao Chin} and Pean, {Der Lin} and Cheng Chen",
year = "1998",
month = "12",
day = "1",
language = "English",
pages = "504--510",
note = "Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS ; Conference date: 14-12-1998 Through 16-12-1998",

}

Wu, CC, Pean, DL & Chen, C 1998, 'Look-ahead memory consistency model', Paper presented at Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, 98-12-14 - 98-12-16 pp. 504-510.

Look-ahead memory consistency model. / Wu, Chao Chin; Pean, Der Lin; Chen, Cheng.

1998. 504-510 Paper presented at Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Look-ahead memory consistency model

AU - Wu, Chao Chin

AU - Pean, Der Lin

AU - Chen, Cheng

PY - 1998/12/1

Y1 - 1998/12/1

N2 - In this paper, we propose a hardware-centric look-ahead memory consistency model that makes the data consistent according to the special ordering requirement of memory accesses for critical sections. The novel model imposes fewer restrictions on event ordering than previously proposed models thus offering the potential of higher performance. The architecture has the following features: (1) blocking and waking up processes by hardware, (2) allowing instructions to be executed out-of-order, (3) until having acquired the lock can the processor allow the requests for accessing the protected data to be evicted to the memory subsystem. The advantages of the look-ahead model include: (1) more program segments are allowed parallel execution, (2) locks can be released earlier, resulting in reduced waiting times for acquiring lock, and (3) less network traffic because more write requests are merged by using two write caches.

AB - In this paper, we propose a hardware-centric look-ahead memory consistency model that makes the data consistent according to the special ordering requirement of memory accesses for critical sections. The novel model imposes fewer restrictions on event ordering than previously proposed models thus offering the potential of higher performance. The architecture has the following features: (1) blocking and waking up processes by hardware, (2) allowing instructions to be executed out-of-order, (3) until having acquired the lock can the processor allow the requests for accessing the protected data to be evicted to the memory subsystem. The advantages of the look-ahead model include: (1) more program segments are allowed parallel execution, (2) locks can be released earlier, resulting in reduced waiting times for acquiring lock, and (3) less network traffic because more write requests are merged by using two write caches.

UR - http://www.scopus.com/inward/record.url?scp=0032290262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032290262&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0032290262

SP - 504

EP - 510

ER -

Wu CC, Pean DL, Chen C. Look-ahead memory consistency model. 1998. Paper presented at Proceedings of the 1998 International Conference on Parallel and Distributed Systems, ICPADS, Tainan, China, .