• Title/Summary/Keyword: page-out

Search Result 330, Processing Time 0.037 seconds

Virtual Memory Compression System on Linux Operating System (Linux 운영체제에서 가상메모리 압축 기법에 대한 연구)

  • 정진우;장승주
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.376-378
    • /
    • 2002
  • 가상 메모리 관리에서 가장 근 문제점은 느린 보조기억 장치의 속도와 빠른 주기억장치의 속도 차이에서 나타나는 성능 저하라고 할 수 있다 요구 페이징 기법에서 Page Fault가 일어나면 페이지 교체 정책에 의해 필요 없는 page들을 swap device로 이동을 시킨다. 이때 느린 보조기억장치의 접근 속도로 인한 응답시간의 지연은 전체적인 시스템 성능의 저하를 초래한다. 그래서 Swap Device로의 접근 횟수와 페이지의 크기를 줄일 수 있다면 Page Out되는 응답시간을 높일 수 있을 것이다. 따라서 본 논문에서는 가상 메모리 압축 시스템을 설계하여 Swap Out 되는 시간을 줄여 시스템의 전체적인 성능 향상을 위한 시스템을 구현한다.

  • PDF

A Study on influence factors of User's Continuous Use Intension in Firm Promotion Social Network Service: by Mediating the Moderator of the Operation Objective Types in Facebook Fan Page (기업 SNS 이용자(고객)의 지속적 사용의도에 관한 연구:Facebook 팬페이지 운영 목적을 조절변수로)

  • Shim, Eunsun;Lee, JungHoon;Jeong, BeobGeun
    • Journal of Information Technology Services
    • /
    • v.12 no.4
    • /
    • pp.41-57
    • /
    • 2013
  • As the usage of SNS has grown dramatically over the last years, it has been used in various sectors not just a tool for communication. In particular, corporate companies actively use Facebook as a tool for corporate marketing. Corporate companies communicate with their customers by providing service or events information. In this study, empirical analysis was carried out on corporate companies that are using Facebook as a marketing tool, thus finding out the influencing factors in continued usage of Facebook Fan Page users. In addition, analysis of the factors will be investigated according to continued usage of the users, where the user's intention will differ depending on how corporate companies operate and deal with the Facebook Fan Page. Factors affecting the user's satisfaction, perceived usefulness, and perceived playfulness were deducted through the analysis of the existing literature study on corporate company's continued intention on the usage of Facebook Fan Page. Accordingly, factor affecting this such as relationship, speed, content diversity, which are the media characteristics of the Facebook were deducted and finally hypothesized. In addition, the type of corporate company's Facebook Fan Page was divided into event type, communication type, information service type. And hence investigated the factors that differed from the continued usage depending on the type. Results analysis shows that perceived usefulness affected only relationship, speed, content diversity. Furthermore, analysis shows that corporate company's Fan Page of communication and event types are the factors that affect the usage intention which meant it only affected the perceived enjoyment. On the basis of this study, we are able to present an implication of value where corporate company use it as a marketing tool, through factors from continued usage of coroporate company's Facebook Fan Page users.

Anti-Angiogenesis Effect and Cytotoxicity of Enterobacteria Isolated from Fusiform Fish

  • Lim, Jong-Kwon;Song, Min-Gyu;Shin, Jin-Hyuk;Lee, Se-Young;Kim, Jong-Deog
    • 한국생물공학회:학술대회논문집
    • /
    • 2005.04a
    • /
    • pp.158-162
    • /
    • 2005
  • Enterobacteria, named ${\lambda}-bacteria$ isolated from fusiform fish, have strong anti-angiogenesis effect. ${\lambda}-28$ species bore higher anti-angiogenesis effect. Cultured liquid was performed salting out, dialysed and freezed dried. This sample was executed size exclusion chromatography with fraction collector. Anti-angiogenesis, cytotoxicity, and SDS-PAGE were carried out with fraction number. ${\lambda}-28$ species was lower toxicity against HUVECs and effective band was conformed with SDS-PAGE.

  • PDF

An Efficient Encryption/Decryption Approach to Improve the Performance of Cryptographic File System in Embedded System (내장형 시스템에서 암호화 파일 시스템을 위한 효율적인 암복호화 기법)

  • Heo, Jun-Young;Park, Jae-Min;Cho, Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.66-74
    • /
    • 2008
  • Since modem embedded systems need to access, manipulate or store sensitive information, it requires being equipped with cryptographic file systems. However, cryptographic file systems result in poor performance so that they have not been widely adapted to embedded systems. Most cryptographic file systems degrade the performance unnecessarily because of system architecture. This paper proposes ISEA (Indexed and Separated Encryption Approach) that supports for encryption/decryption in system architecture and removes redundant performance loss. ISEA carries out encryption and decryption at different layers according to page cache layer. Encryption is carried out at lower layer than page cache layer while decryption at upper layer. ISEA stores the decrypted data in page cache so that it can be reused in followed I/O request without decryption. ISEA provides page-indexing which divides page cache into cipher blocks and manages it by a block. It decrypts pages partially so that it can eliminate unnecessary decryption. In synthesized experiment of read/write with various cache hit rates, it gives results suggesting that ISEA has improved the performance of encryption file system efficiently.

Effect of ASLR on Memory Duplicate Ratio in Cache-based Virtual Machine Live Migration

  • Piao, Guangyong;Oh, Youngsup;Sung, Baegjae;Park, Chanik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.4
    • /
    • pp.205-210
    • /
    • 2014
  • Cache based live migration method utilizes a cache, which is accessible to both side (remote and local), to reduce the virtual machine migration time, by transferring only irredundant data. However, address space layout randomization (ASLR) is proved to reduce the memory duplicate ratio between targeted migration memory and the migration cache. In this pager, we analyzed the behavior of ASLR to find out how it changes the physical memory contents of virtual machines. We found that among six virtual memory regions, only the modification to stack influences the page-level memory duplicate ratio. Experiments showed that: (1) the ASLR does not shift the heap region in sub-page level; (2) the stack reduces the duplicate page size among VMs which performed input replay around 40MB, when ASLR was enabled; (3) the size of memory pages, which can be reconstructed from the fresh booted up state, also reduces by about 60MB by ASLR. With those observations, when applying cache-based migration method, we can omit the stack region. While for other five regions, even a coarse page-level redundancy data detecting method can figure out most of the duplicate memory contents.

MOC: A Multiple-Object Clustering Scheme for High Performance of Page-out in BSD VM (MOC: 다중 오브젝트 클러스터링을 통한 BSD VM의 페이지-아웃 성능 향상)

  • Yang, Jong-Cheol;Ahn, Woo-Hyun;Oh, Jae-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.476-487
    • /
    • 2009
  • The virtual memory system in 4.4 BSD operating systems exploits a clustering scheme to reduce disk I/Os in paging out (or flushing) modified pages that are intended to be replaced in order to make free rooms in memory. Upon the page out of a victim page, the scheme stores a cluster (or group) of modified pages contiguous with the victim in the virtual address space to swap disk at a single disk write. However, it fails to find large clusters of contiguous pages if applications change pages not adjacent with each other in the virtual address space. To address the problem, we propose a new clustering scheme called Multiple-Object Clustering (MOC), which together stores multiple clusters in the virtual address space at a single disk write instead of paging out the clusters to swap space at separate disk I/Os. This multiple-cluster transfer allows the virtual memory system to significantly decrease disk writes, thus improving the page-out performance. Our experiments in the FreeBSD 6.2 show that MOC improves the execution times of realistic benchmarks such as NS2, Scimark2 SOR, and nbench LU over the traditional clustering scheme ranging from 9 to 45%.

On Bulk-Loading B+-trees (B+ 트리를 위한 벌크 로드)

  • Kim, Sang-Wook;Whang, Whan-Kyu
    • Journal of Industrial Technology
    • /
    • v.15
    • /
    • pp.235-244
    • /
    • 1995
  • In this paper, we propose a bulk-load algorithm for $B^+-trees$, the most widely used index structures in database systems. The main characteristic of our algorithm is to simultaneously process all the keys to be placed on each $B^+-trees$ page when accessing the page. This avoids the overhead for accessing the same page multiple times, which results from applying the $B^+-trees$ insertion algorithm repeatedly. For performance evaluation, we analyze our algorithm in terms of the number of disk accesses. The results show that the number of disk accesses excluding those in the redistribution process in identical to the number of $B^+-trees$ pages. Considering that the redistribution process is an unavoidable preprocessing step for bulk-loading, our algorithm requires just one disk access per $B^+-trees$ page, and therefore turns out to be optimal. We also present performance tendancy according to the changes of parameter values via simulation.

  • PDF

Mining Parallel Text from the Web based on Sentence Alignment

  • Li, Bo;Liu, Juan;Zhu, Huili
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2007.11a
    • /
    • pp.285-292
    • /
    • 2007
  • The parallel corpus is an important resource in the research field of data-driven natural language processing, but there are only a few parallel corpora publicly available nowadays, mostly due to the high labor force needed to construct this kind of resource. A novel strategy is brought out to automatically fetch parallel text from the web in this paper, which may help to solve the problem of the lack of parallel corpora with high quality. The system we develop first downloads the web pages from certain hosts. Then candidate parallel page pairs are prepared from the page set based on the outer features of the web pages. The candidate page pairs are evaluated in the last step in which the sentences in the candidate web page pairs are extracted and aligned first, and then the similarity of the two web pages is evaluate based on the similarities of the aligned sentences. The experiments towards a multilingual web site show the satisfactory performance of the system.

  • PDF

How Can We Erase States Inside a Black Hole?

  • Hwang, Junha;Park, Hyosub;Yeom, Dong-han;Zoe, Heeseung
    • Journal of the Korean Physical Society
    • /
    • v.73 no.10
    • /
    • pp.1420-1430
    • /
    • 2018
  • We investigate an entangled system, which is analogous to a composite system of a black hole and Hawking radiation. If Hawking radiation is well approximated by an outgoing particle generated from pair creation around the black hole, such a pair creation increases the total number of states. There should be a unitary mechanism to reduce the number of states inside the horizon for black hole evaporation. Because the infalling antiparticle has negative energy, as long as the infalling antiparticle finds its partner such that the two particles form a separable state, one can trace out such a zero energy system by maintaining unitarity. In this paper, based on some toy model calculations, we show that such a unitary tracing-out process is only possible before the Page time while it is impossible after the Page time. Hence, after the Page time, if we assume that the process is unitary and the Hawking pair forms a separable state, the internal number of states will monotonically increase, which is supported by the Almheiri-Marolf-Polchinski-Sully (AMPS) argument. In addition, the Hawking particles cannot generate randomness of the entire system; hence, the entanglement entropy cannot reach its maximum. Based on these results, we modify the correct form of the Page curve for the remnant picture. The most important conclusion is this: if we assume unitarity, semi-classical quantum field theory, and general relativity, then the black hole should violate the Bekenstein-Hawking entropy bound around the Page time at the latest; hence, the infinite production arguments for remnants might be applied for semi-classical black holes, which seems very problematic.

Classification of Meat-Based Listeria monocytogenes Using Whole-Cell Protein Patterns and Serotyping Analysis

  • Park, Si-Hong;Jung, Sang-Hoon;Kim, Hyun-Joong;Chung, Yun-Hee;Kim, Hae-Yeong
    • Food Science and Biotechnology
    • /
    • v.15 no.2
    • /
    • pp.324-327
    • /
    • 2006
  • The food-borne pathogen Listeria monocytogenes is commonly associated with meats and unpasteurized dairy products. To identify this pathogen in meats more efficiently than has been done in the past, we purchased meats from Korean markets and performed sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) and serotyping analysis on Listeria organisms isolated from meat samples. Each Listeria species showed specific protein band patterns on SDS-PAGE. Whole-cell protein SDS-PAGE profiles indicated that the organisms isolated from meats sold in local Korean markets were L. monocytogenes with the serotypes 1/2a, 1/2b, 1/2c, and 4b. We suggest that it is possible to carry out molecular subtyping of L. monocytogenes using SDS-PAGE.