• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.1-8
• /
• 2018

In this paper, we propose an adaptive partition cache replacement policy and evaluate the performance of our scheme using various monitoring ratios to help lifetime extension of non-volatile main memory systems without performance degradation. The proposal combines conventional LRU (Least Recently Used) replacement policy and Early Eviction Zone (E2Z), which considers a dirty bit as well as LRU bits to select a candidate block. In particular, this paper shows the performance of non-volatile memory using various monitoring ratios and determines optimized monitoring ratio and partition size of E2Z for reducing the number of writebacks using cache hit counter logic and hit predictor. In the experiment evaluation, we showed that 1:128 combination provided the best results of writebacks and runtime, in terms of performance and complexity trade-off relation, and our proposal yielded up to 42% reduction of writebacks, compared with others.

• Journal of English Language & Literature
• /
• v.55 no.2
• /
• pp.337-357
• /
• 2009

Ned Kelly, the bushranger, is a legendary figure of special significance to the Australians of today. The Aussies' affection for this "horse thief" derives from the fact that the latter has become a national ideal of the "battler" who does not give up in the face of hardships. Peter Carey's is considered to be one of the "national narratives" that not only heroize but also give voice to the Irish rebels who fought for "fair go" in the colonial Australia. However, this paper asserts that there are more to the novel than merely paying a tribute to the national icon, especially when the novel is examined in the context of the "republic controversy." In 1999, the preceding year of the novel's publication, Australia had a national referendum on the issue of whether or not to secede from the Commonwealth. Due to the procedural manipulation of the royalist ruling party, republicanism was voted down. At the time when the majority of Australians were irate with the result of the referendum, Carey's retelling of the supposedly anti-British rebel failed to promote the lost cause. This paper investigates how the narrativization of the legendary figure, whose anti-British and anti-authoritarian attitude can be easily translated into the cause of republicanism, came to appeal to the general reading public. In so doing, this paper compares Carey's novel with the historical Kelly's two epistles: Jerilderie and Cameron Letter. This comparison brings to light what is left out in the process of Carey's narrativization of the rebel's life: the subversive militant voice of an Irish nationalist. The conclusion of this paper is that the possibility for Kelly's life to surface again in the 21st century as a sort of counter-memory is contained by Carey through its inclusion in a highly personalized domestic narrative.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.790-798
• /
• 2008

Recently, NAND flash memory has emerged as a next generation storage device because it has several advantages, such as low power consumption, shock resistance, and so on. However, it is necessary to use a flash translation layer (FTL) to intermediate between NAND flash memory and conventional file systems because of the unique hardware characteristics of flash memory. This paper proposes a new clustered FTL (CFTL) that uses clustered hash tables and a two-level software cache technique. The CFTL can anticipate consecutive addresses from the host because the clustered hash table uses the locality of reference in a large address space. It also adaptively switches logical addresses to physical addresses in the flash memory by using block mapping, page mapping, and a two-level software cache technique. Furthermore, anticipatory I/O management using continuity counters and a prefetch scheme enables fast address translation. Experimental results show that the proposed address translation mechanism for CFTL provides better performance in address translation and memory space usage than the well-known NAND FTL (NFTL) and adaptive FTL (AFTL).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.1
• /
• pp.3-10
• /
• 2017

Counting Bloom filters (CBFs) have been popularly used in many network algorithms and applications for the membership queries of dynamic sets, since CBFs can provide delete operations, which are not provided in a standard 1-bit vector Bloom filter. However, because of the counting functions, a CBF can have overflows and accordingly false negatives. CBFs composed of 4-bit counters are generally used, but the 4-bit CBF wastes memory spaces by allocating 4 bits for every counter. In this paper, we propose a simple alternative of a 4-bit CBF named ternary Bloom filter (TBF). In the proposed TBF structure, if two or more elements are mapped to a counter in programming, the counters are not used for insertion or deletion operations any more. When the TBF consumes the same amount of memory space as a 4-bit CBF, it is shown through simulation that the TBF provides a better false positive rate than the CBF as well as the TBF does not generate false negatives.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.8
• /
• pp.309-315
• /
• 1986

We proposed a preliminary Data Flow Machine Model(DNL1) operating on the basis of Node Label. In this model, all the PMs(Processing Modules) were synchronized with the content of LC(Level Counter) and were not implemented dy the processing cability on conditional nodes. This paper presents an architecture of a concurrent multiprocessor system which was developed from DNL1 with two additional types of memories, CF(Control Flag) and ETF (Enabled Token Flag). The CF memory holds the control condition flag ('1' or '0') to be referenced to when a node is fired and the ETF represents the firability of a certain node. Firable nodes are fetched to the PU(Processing Unit) and processed. This Data Flow system can be extended hierarchically by a network of simple modules. The principle working elements of the machine are a set of PMs, each of which performs the execution of the data flow procedures held in a local memory, NTM(Node Token Memory) within the PM.

• Journal of Korean Society of Archives and Records Management
• /
• v.16 no.2
• /
• pp.57-79
• /
• 2016

This study aims to identify and analyze how the No Gun Ri massacre records are incorporated in social memory. As a theoretical study, it discusses the characteristics of social records. First, they are social products that have an influence on personal memory. Second, they reflect variability of memory. Third, they can be used in proving an event. To analyze the memory and records of the No Gun Ri massacre, this study overviews the outline of the killings and divides it into three eras: countermemory era, memory struggle era, and formal memory era. Furthermore, this study reviews the transformation process and characteristics of each era. The representative records produced in each era are as follows: oral, and personal records in the first period; records related to committee activities, legislative activities, and research activities in the second period; and official records on the special law, and the construction and operation of a peace park in the third period. The third period shows the scalability of the records through a variety of cultural records production to remember the No Gun Ri incident.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.10
• /
• pp.421-426
• /
• 2013

As a greater amount of traffic have been generated on the Internet, it becomes more important to know the size of each flow. Many research studies have been conducted on the traffic measurement, and mostly they have focused on how to increase the measurement accuracy with a limited amount of memory. In this paper, we propose an explicit flow labeling technique that can be used to find out the names of the top flows and to increase the counting upper bound of the existing scheme. The labeling technique is applied to CSM (Counter Sharing Method), the most recent traffic measurement algorithm, and the performance is evaluated using the CAIDA dataset.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1554-1563
• /
• 1999

This paper presents the design of high speed processor for a sequence logic control using field programmable gate array(FPGA). The sequence logic controller is widely used for automating a variety of industrial plants. The FPGA designed by VHDL consists of program and data memory interface block, input and output block, instruction fetch and decoder block, register and ALU block, program counter block, debug control block respectively. Dedicated clock inputs in the FPGA were used for high speed execution, and also the program memory was separated from the data memory for high speed execution of the sequence instructions at 40 MHz clock. Therefore it was possible that sequence instructions could be operated at the same time during the instruction fetch cycle. In order to reduce the instruction decoding time and the interface time of the data memory interface, an instruction code size was implemented by 16 bits or 32 bits respectively. And the real time debug operation was implemented for easy debugging the designed processor. This FPGA was synthesized by pASIC 2 SpDE and Synplify-Lite synthesis tool of Quick Logic company. The final simulation for worst cases was successfully performed under a Verilog HDL simulation environment. And the FPGA programmed for an 84 pin PLCC package was applied to sequence control system with inputs and outputs of 256 points. The designed processor for the sequence logic was compared with the control system using the DSP(TM320C32-40MHz) and conventional PLC system. The designed processor for the sequence logic showed good performance.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.7
• /
• pp.1015-1024
• /
• 1990

This paper proposes a program counter unit(PCU) on the pipelined architecture of RISC (Reduced Instruction Set Computer) type high performance processors, PCU is used for supplying instruction addresses to memory units(Instruction Cache) efficiently. A RISC processor's PCU has to compute the instruction address within required intervals continnously. So, using the method of self-generated incrementor, is more efficient than the conventional one's using ALU or private adder. The proposed PCU is designed to have the fast +4(Byte Address) operation incrementor that has no carry propagation delay. Design specifications are taken by analyzing the whole data path operation of target processor's default and exceptional mode instructions. CMOS and wired logic circuit technologic are used in PCU for the fast operation which has small layout area and power dissipation. The schematic capture and logic, timing simulation of proposed PCU are performed on Apollo W/S using Mentor Graphics CAD tooks.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3067-3069
• /
• 1999

In this paper, A bit processor for controlling sequence logic was implemented, using a FPGA. This processor consists of program memory interface. I/O interface, parts for instruction fetch and decode, registers, ALU, program counter and etc. This FPGA is able to execute sequence instruction during program fetch cycle, because of divided bus system, program bus and data bus. Also this bit processor has instructions set that 16bit or 32bit fixed width, so instruction decoding time and data memory interface time was reduced. This FPGA was synthesized by pASIC 2 SpDE and Synplify-Lite synthesis tool of Quick Logic company. The final simulation for worst cases was successfully performed under a Verilog HDL simulation environment. And the FPGA programmed for an 84 pin PLCC package. Finally, the benchmark was performed to prove that Our FPGA has better performance than DSP(TMS320C32-40MHz) for the sequence logic control of PLC.