computer memory structure

基本解釋

[計(jì)算機(jī)科學(xué)技術(shù)]計(jì)算器內(nèi)存結(jié)構(gòu)計(jì)算機(jī)存儲(chǔ)結(jié)構(gòu)計(jì)算機(jī)存儲(chǔ)器結(jié)構(gòu)計(jì)算機(jī)記憶體結(jié)構(gòu)

In order to solve this serious problem, hierarchical memory structure is widely used in modern computer systems.
層次存儲(chǔ)結(jié)構(gòu)被廣泛用于計(jì)算機(jī)系統(tǒng)中來(lái)解決上述瓶頸問題。
The data structure is so designed that it enables a minicomputer without an external memory, such as a DJS-130 computer, to handle the vast data of mask graph.
其數(shù)據(jù)結(jié)構(gòu)使得像DJS-130這樣的小型計(jì)算機(jī)（沒有外存貯器）能處理大量的版圖數(shù)據(jù)。
This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.
本文以鄰接矩陣作為圖的存儲(chǔ)結(jié)構(gòu)，指出如何在計(jì)算機(jī)上實(shí)現(xiàn)克魯斯卡爾算法，并分析所設(shè)計(jì)算法的時(shí)間復(fù)雜度。
www.cscaa.org.cn