• Title/Summary/Keyword: memory latency

Search Result 361, Processing Time 0.038 seconds

Microarray Analysis of Gene Expression in Rat Hippocampus of Maternal Social Separation Model (모성 및 사회성 분리 백서 모델의 해마에서 유전자 칩을 이용한 유전자 발현 연구)

  • Lee, Hee Jae;Son, Chang Hee;Kwak, Hyong Ryol;Lee, Sang-Hyun;Han, Yoon Hee;Kim, Soo Young;Park, Jong-Ik;Chun, Wanjoo;Kim, Sung-Soo
    • Korean Journal of Biological Psychiatry
    • /
    • v.13 no.2
    • /
    • pp.110-116
    • /
    • 2006
  • Objectives : Alteration of hippocampus was demonstrated in the maternal social separation(MSS) pups, separated from dams on postnatal day(pnd) 14 and placed alone. Therefore, to understand the molecular events involved in the MSS, we have initiated a search for gene profiles that are up or down-regulated in the hippocampus of MSS pups. Methods : Analysis of cDNA microarray was performed by using total RNA extracted from the hippocampus of control and MSS pups on pnd 17. Also, passive-avoidance test was demonstrated on pnd 35. Results : Up-regulation of Nedd4a was observed in the hippocampus of MSS pups. Also, MSS rats showed less elongation of latency in passive avoidance test. Conclusion : We suggest that environmental effects of MSS may be altered the neural and/or glial differentiation and synapse formation-related genes which may lead cognitive alterations in MSS rats.

  • PDF

Design and Evaluation of Flexible Thread Partitioning System (융통성 있는 스레드 분할 시스템 설계와 평가)

  • Jo, Sun-Moon
    • Journal of Internet Computing and Services
    • /
    • v.8 no.3
    • /
    • pp.75-83
    • /
    • 2007
  • Multithreaded model is an effective parallel system in that it can reduce the long memory reference latency time and solve the synchronization problems. When compiling the non-strict functional programs for the multithreaded parallel machine, the most important thing is to find an set of sequentially executable instructions and to partitions them into threads. The existing partitioning algorithm partitions the condition of conditional expression, true expression and false expression into the basic blocks and apply local partitioning to these basic blocks. We can do the better partitioning if we modify the definition of the thread and allow the branching within the thread. The branching within the thread do not reduce the parallelism, do not increase the number of synchronization and do not violate the basic rule of the thread partitioning. On the contrary, it can lengthen the thread and reduce the number of synchronization. In the paper, we enhance the method of the partition of threads by combining the three basic blocks into one of two blocks.

  • PDF

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

Two Cases of Narcolepsy Patient Portraying a Tendency of a Dull Learning Ability and Mistaken as an Idle Student (학습부진 양상을 보이고 나태한 학생으로 오인된 기면증 환자 2 례)

  • Lee, Seung-Hwan;Kim, Sun-Kook;Kim, Leen;Chung, Young-Cho;Suh, Kwang-Yoon
    • Sleep Medicine and Psychophysiology
    • /
    • v.8 no.2
    • /
    • pp.138-143
    • /
    • 2001
  • Sleepiness is associated with many different conditions and, as a neglected topic, it can be the cause of serious psychological and social disadvantages. In the aspect of learning, additional problems may arise from poor progress in school caused by the effect of sleepiness on concentration, memory, and other cognitive functions. Narcolepsy is by no means the most common cause of excessive sleepiness. Nonetheless, it is not a rarity, especially in young people. The non-specific nature of early features of narcolepsy, combined with very limited awareness that the condition can start in various ways, leads to many misinterpretations. Misinterpretation of narcolepsy symptoms is not confined to the medical profession. Teachers may well be critical of a student with narcolepsy because of their perception of narcolepsy symptoms as laziness, poor motivation, or difficult behavior and dull learning ability. Inappropriate reactions by parents, teachers, and peers, based on misinterpretation of narcolepsy symptoms or the patient's reactions to them, make a difficult situation worse. Especially in Korea, where schooling is focused on college entrance examinations, the problem is very serious and intensified by inappropriate or delayed diagnosis and treatment. Therefore, psychiatrists should be aware that narcolepsy in young adolescents is not rare and that they need to be familiar with its clinical features in both its classic and less obvious forms. Narcolepsy should be suspected if a adolescent's excessive sleepiness can not be explained in other ways. Therefore, we report on two patients who portray the tendency of dull learning ability and are mistaken as idle students. We diagnosed narcolepsy through polysomnography and multiple sleep latency testing. We treated the students with methylphenidate and pemolin. The students showed improvement in learning ability and were able to adapt better to school.

  • PDF

Hybrid Priority Medium Access Control Scheme for Wireless Body Area Networks (무선 인체통신 네트워크를 위한 복합 우선순위 MAC 기법)

  • Lee, In-Hwan;Lee, Gun-Woo;Cho, Sung-Ho;Choo, Sung-Rae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1305-1313
    • /
    • 2010
  • Last few years, wireless personal area network (WPAN) has been widely researched for various healthcare applications. Due to restriction of device hardware (e.g., energy and memory), we need to design a highly-versatile MAC layer protocol for WBAN (Wireless Body Area Network). In addition, when an emergency occurs to a patient, a priority mechanism is necessitated for a urgent message to get through to the final destination. This paper presents a priority mechanism referred to as hybrid priority MAC for WBAN. Through extensive simulation, we show the proposed MAC protocol can minimize the average packet latency for urgent data. Thus, when patients have an emergency situation, our MAC allows adequate assistance time and medical treatment for patients. The simulation based on NS-2 shows that our Hybrid Priority MAC has the good performance and usability.

FlashEDF: An EDF-style Scheduling Scheme for Serving Real-time I/O Requests in Flash Storage

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.26-34
    • /
    • 2018
  • In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

Analyzing Fine-Grained Resource Utilization for Efficient GPU Workload Allocation (GPU 작업 배치의 효율화를 위한 자원 이용률 상세 분석)

  • Park, Yunjoo;Shin, Donghee;Cho, Kyungwoon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.1
    • /
    • pp.111-116
    • /
    • 2019
  • Recently, GPU expands application domains from graphic processing to various kinds of parallel workloads. However, current GPU systems focus on the maximization of each workload's parallelism through simplified control rather than considering various workload characteristics. This paper classifies the resource usage characteristics of GPU workloads into computing-bound, memory-bound, and dependency-latency-bound, and quantifies the fine-grained bottleneck for efficient workload allocation. For example, we identify the exact bottleneck resources such as single function unit, double function unit, or special function unit even for the same computing-bound workloads. Our analysis implies that workloads can be allocated together if fine-grained bottleneck resources are different even for the same computing-bound workloads, which can eventually contribute to efficient workload allocation in GPU.

Extracting optimal moving patterns of edge devices for efficient resource placement in an FEC environment (FEC 환경에서 효율적 자원 배치를 위한 엣지 디바이스의 최적 이동패턴 추출)

  • Lee, YonSik;Nam, KwangWoo;Jang, MinSeok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.1
    • /
    • pp.162-169
    • /
    • 2022
  • In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

Implementation of FPGA-based Accelerator for GRU Inference with Structured Compression (구조적 압축을 통한 FPGA 기반 GRU 추론 가속기 설계)

  • Chae, Byeong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.6
    • /
    • pp.850-858
    • /
    • 2022
  • To deploy Gate Recurrent Units (GRU) on resource-constrained embedded devices, this paper presents a reconfigurable FPGA-based GRU accelerator that enables structured compression. Firstly, a dense GRU model is significantly reduced in size by hybrid quantization and structured top-k pruning. Secondly, the energy consumption on external memory access is greatly reduced by the proposed reuse computing pattern. Finally, the accelerator can handle a structured sparse model that benefits from the algorithm-hardware co-design workflows. Moreover, inference tasks can be flexibly performed using all functional dimensions, sequence length, and number of layers. Implemented on the Intel DE1-SoC FPGA, the proposed accelerator achieves 45.01 GOPs in a structured sparse GRU network without batching. Compared to the implementation of CPU and GPU, low-cost FPGA accelerator achieves 57 and 30x improvements in latency, 300 and 23.44x improvements in energy efficiency, respectively. Thus, the proposed accelerator is utilized as an early study of real-time embedded applications, demonstrating the potential for further development in the future.

Probiotics that Ameliorate Cognitive Impairment through Anti-Inflammation and Anti-Oxidation in Mice

  • Shinhui Lee;Sanung Eom;Jiwon Lee;Minsu Pyeon;Kieup Kim;Kyu Yeong Choi;Jung Hee Lee;Da Jeong Shin;Kun Ho Lee;Sejong Oh;Junho H Lee
    • Food Science of Animal Resources
    • /
    • v.43 no.4
    • /
    • pp.612-624
    • /
    • 2023
  • The gut-brain axis encompasses a bidirectional communication pathway between the gastrointestinal microbiota and the central nervous system. There is some evidence to suggest that probiotics may have a positive effect on cognitive function, but more research is needed before any definitive conclusions can be drawn. Inflammation-induced by lipopolysaccharide (LPS) may affect cognitive function. To confirm the effect of probiotics on oxidative stress induced by LPS, the relative expression of antioxidant factors was confirmed, and it was revealed that the administration of probiotics had a positive effect on the expression of antioxidant-related factors. After oral administration of probiotics to mice, an intentional inflammatory response was induced through LPS i.p., and the effect on cognition was confirmed by the Morris water maze test, nitric oxide (NO) assay, and interleukin (IL)-1β enzyme-linked immunosorbent assay performed. Experimental results, levels of NO and IL-1β in the blood of LPS i.p. mice were significantly decreased, and cognitive evaluation using the Morris water maze test showed significant values in the latency and target quadrant percentages in the group that received probiotics. This proves that intake of these probiotics improves cognitive impairment and memory loss through anti-inflammatory and antioxidant mechanisms.