Nebojsa Z. Milenkovic's research while affiliated with University of Niš and other places

Publications (11)

Article
Full-text available
In modern computing technique, calculation of leading zeros in a data represented as strings of digits is used very often. Those techniques require high speed of the circuit, as well as its fast design. In this paper we propose a design of such a counter, which is applicable to data length of w = 4j bits, for 4 < j ≤ 8. With this solution it is als...
Article
In the arsenal of resources for computer memory system performance improvement, predictors have gained an increasing role in the past years. They can suppress latencies when accessing cache or main memory. In our previous work we considered using predictors to decrease Synchronized Dynamic Random Access Memory (SDRAM) latency. If one wants to apply...
Article
In the arsenal of resources for improving computer memory system performance, predictors have gained an increasing role in the past few years. They can suppress the latencies when accessing cache or main memory. In our previous work we proposed predictors that not only close the opened DRAM row but also predict the next row to be opened, hence the...
Article
In the arsenal of resources for improving computer memory system performance, predictors have gained an increasing role in the past few years. They enable hiding the latencies when accessing cache or main memory. In our previous work we proposed a DDR SDRAM controller with predictors that not only close the opened DRAM row but also predict the next...
Article
In the arsenal of resources for computer memory system performance improvement, predictors have gained an increasing role in the past years. They can suppress the latencies when accessing cache or main memory. In paper[1] it is shown how temporal parameters of cache memory access, defined as live time, dead time and access interval could be used fo...
Conference Paper
Full-text available
Better insight of programs behavior can help in overcoming large speed difference of central processors and main memories implemented with DRAM chips. It allows us to predict required next actions, based on observed main memory access patterns, which can hide some time components in accessing DRAM memory. Authors of this paper proposed a simple dea...
Conference Paper
In the arsenal of solutions for computer memory system performance improvement, predictors have gained an increasing role in the past years. They enable hiding the latencies when accessing cache or main memory. Recently the technique of using temporal parameters of cache memory accesses and tag patterns observing has been applied by some authors fo...
Article
Full-text available
Performances of DRAM memories are characterized by memory latency and bandwidth. Contemporary DRAM memories more successfully satisfy demands for higher bandwidth than lower latency. In this paper solutions, which may reduce latency of these memories, are investigated. These solutions are two new controller policies called 'Write-miss Only Close-Pa...
Conference Paper
DRAM memory performance is critical, factor in many multimedia applications. Some techniques, which improve DRAM memory performance, are proposed in this paper. These are, first, combined strategies of opening and closing DRAM pages, and second, address remapping in DRAM memory referencing. Simulations we have done showed some improvements in laten...
Conference Paper
DSP and multimedia applications can be very demanding of memory parameters. Typical requirements of memory parameters in such applications are quoted in the paper. Based on these requirements, two types of contemporary DRAM memories, Rambus DRAM and SLDRAM, are considered as candidate memories in such systems. The results given in the paper show th...
Article
Full-text available
Sadržaj – Pristupi dinamičkoj (SDRAM) memoriji uključuju tri aktivnosti: pretpunjenje, aktiviranje (Abstract – Dynamic memory accesses include three activities: precharge, row activation and column access, each of about 15 ns or more. For a sequence of successive accesses to columns into the same row of a bank, precharge and row activation must pre...

Citations

... For instance, the "zeros" correspond to the left word bits and the "ones" to the right word bits (LZC in = B 0 = 00..01..11). The main principle of LZC is to define the number of zeroes crossed from the most significant position of B 0 to reach the first one of this input data bits [50]. ...
... However if there is an entry for the accessed row it will be closed after the expected number of accesses suggested by the history table. More techniques using access-based page closure prediction can be found in [20,21,22,23,24,25,26]. ...
... The systems community uses several approaches to handle granularity change. There is work on scheduling memory controllers at granularity boundaries [16,26,27,39,40,41], address mapping techniques [33,23,38,35], row-buffer management [25,28,32,34], and item-to-block allocation [11,12,5,29]. Recently, DRAM caches account for granularity change by taking some or all of the larger-granularity block into the smaller-granularity cache on loads [30,22,21]. ...
... Some of these methods propose prediction strategy [1,2]. They predict whether an opened row should be closed or not, which row should be speculatively activated and so on. ...
... However if there is an entry for the accessed row it will be closed after the expected number of accesses suggested by the history table. More techniques using access-based page closure prediction can be found in [20,21,22,23,24,25,26]. ...