Division of Computer Science And Engineering > 자유게시판

본문 바로가기

사이트 내 전체검색

자유게시판

Division of Computer Science And Engineering

페이지 정보

작성자 Willian 작성일 25-08-11 20:46 조회 12 댓글 0

본문

In computing, interleaved memory is a design which compensates for the comparatively slow pace of dynamic random-entry memory (DRAM) or core memory, by spreading memory addresses evenly throughout memory banks. That manner, contiguous memory reads and writes use every memory financial institution in flip, resulting in higher memory throughput as a result of decreased ready for memory banks to turn out to be ready for the operations. It is different from multi-channel memory architectures, primarily as interleaved Memory Wave Audio does not add more channels between the principle memory and the memory controller. However, channel interleaving can be attainable, for example in freescale i.MX6 processors, which permit interleaving to be accomplished between two channels. With interleaved memory, memory addresses are allotted to every memory financial institution in turn. For instance, Memory Wave in an interleaved system with two memory banks (assuming word-addressable memory), if logical handle 32 belongs to bank 0, then logical deal with 33 would belong to financial institution 1, logical address 34 would belong to bank 0, and so forth. An interleaved memory is alleged to be n-means interleaved when there are n banks and memory location i resides in bank i mod n.



Interleaved memory leads to contiguous reads (which are widespread both in multimedia and execution of applications) and contiguous writes (which are used ceaselessly when filling storage or communication buffers) actually using every memory bank in flip, instead of using the identical one repeatedly. This ends in considerably higher memory throughput as every financial institution has a minimum waiting time between reads and writes. Principal memory (random-entry memory, RAM) is normally composed of a set of DRAM memory chips, where quite a few chips can be grouped collectively to kind a memory bank. It's then attainable, with a memory controller that helps interleaving, to lay out these memory banks in order that the memory banks will be interleaved. Information in DRAM is saved in models of pages. Each DRAM financial institution has a row buffer that serves as a cache for accessing any web page in the financial institution. Before a web page in the DRAM bank is read, it's first loaded into the row-buffer.



In_Memory_-_geograph.org.uk_-_556820.jpgIf the page is immediately read from the row-buffer (or a row-buffer hit), it has the shortest memory access latency in a single memory cycle. If it's a row buffer miss, which can be known as a row-buffer conflict, it's slower as a result of the new page must be loaded into the row-buffer before it is read. Row-buffer misses happen as access requests on totally different memory pages in the same financial institution are serviced. A row-buffer battle incurs a substantial delay for a memory entry. In contrast, memory accesses to totally different banks can proceed in parallel with a high throughput. The problem of row-buffer conflicts has been well studied with an effective resolution. The dimensions of a row-buffer is generally the dimensions of a memory web page managed by the working system. Row-buffer conflicts or misses come from a sequence of accesses to distinction pages in the same memory financial institution. The permutation-based mostly interleaved memory methodology solved the issue with a trivial microarchitecture cost.



Sun Microsystems adopted this the permutation interleaving method rapidly in their products. This patent-free technique will be found in lots of industrial microprocessors, corresponding to AMD, Intel and NVIDIA, for embedded methods, laptops, desktops, and enterprise servers. In conventional (flat) layouts, memory banks might be allocated a contiguous block of memory addresses, which is very simple for the memory controller and offers equal performance in completely random entry scenarios, when compared to performance levels achieved via interleaving. Nevertheless, in actuality memory reads are rarely random resulting from locality of reference, and optimizing for close together access gives far better performance in interleaved layouts. The way memory is addressed has no effect on the entry time for memory areas which are already cached, having an influence solely on memory locations which must be retrieved from DRAM. Zhao Zhang, Zhichun Zhu, and Xiaodong Zhang (2000). A Permutation-based mostly Page Interleaving Scheme to cut back Row-buffer Conflicts and Memory Wave Exploit Data Locality. Department of Laptop Science and Engineering, College of Engineering, Ohio State College. Mark Smotherman (July 2010). "IBM Stretch (7030) - Aggressive Uniprocessor Parallelism".

댓글목록 0

등록된 댓글이 없습니다.

  • 주소 : 부산시 강서구 평강로 295
  • 대표번호 : 1522-0625
  • 이메일 : cctvss1004@naver.com

Copyright © 2024 씨씨티브이세상 All rights reserved.

상담신청

간편상담신청

카톡상담

전화상담
1522-0625

카톡상담
실시간접수