Korean Institute of Information Scientists and Engineers

Displaying 1-37 of 37 results

  • White Papers // Mar 2014

    SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

    Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SSDRM is based on...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2014

    Comparing Separate and Statically-Partitioned Caches for Time-Predictable Multicore Processors

    In this paper, the authors quantitatively compare two different time-predictable multicore cache architectures, separate and statically-partitioned caches, through extensive simulation. Current research trends primarily focus on partitioned-cache architectures in order to achieve time predictability for hard real-time multicore based systems, and their experiments reveal that separate caches actually lead to...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2014

    Exploiting Standard Deviation of CPI to Evaluate Architectural Time-Predictability

    Time-predictability of computing is critical for hard real-time and safety-critical systems. However, currently there is no metric available to quantitatively evaluate time-predictability, a feature crucial to the design of time-predictable processors. This paper first proposes the concept of architectural time-predictability, which separates the time variation due to hardware architectural/microarchitectural design...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2013

    Counter-Based Approaches for Efficient WCET Analysis of Multicore Processors with Shared Caches

    To enable hard real-time systems to take advantage of multicore processors, it is crucial to obtain the Worst-Case Execution Time (WCET) for programs running on multicore processors. However, this is challenging and complicated due to the inter-thread interferences from the shared resources in a multicore processor. Recent paper used the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2013

    Overview of Real-Time Java Computing

    In this paper, the authors present a complete survey of recent techniques that are applied in the field of real-time java computing. It focuses on the issues that are especially important for hard real-time applications, which include time predictable garbage collection, worst-case execution time analysis of java programs, real-time java...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Energy Aware Scheduling of Aperiodic Real-Time Tasks on Multiprocessor Systems

    Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This paper...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Bounding Worst-Case DRAM Performance on Multicore Processors

    Bounding the worst-case DRAM performance for a real-time application is a challenging problem that is critical for computing Worst-Case Execution Time (WCET), especially for multicore processors, where the DRAM memory is usually shared by all of the cores. Typically, DRAM commands from consecutive DRAM accesses can be pipelined on DRAM...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It Too

    Over the past generation, data warehousing and On-Line Analytical Processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional Relational DBMSs (RDBMS). While MOLAP systems do indeed provide impressive...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Feb 2013

    Multicore Real-Time Scheduling to Reduce Inter-Thread Cache Interferences

    The Worst-Case Execution Time (WCET) of each real-time task in multicore processors with shared caches can be significantly affected by inter-thread cache interferences. The worst-case inter-thread cache interferences are dependent on how tasks are scheduled to run on different cores. Therefore, there is a circular dependence between real-time task scheduling,...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    Computational Methods for On-Node Performance Optimization and Inter-Node Scalability of HPC Applications

    In the age of multi-core and specialized accelerators in High Performance Computing (HPC) systems, it is critical to understand application characteristics and apply suitable optimizations in order to fully utilize advanced computing system. Often time, the process involves multiple stages of application performance diagnosis and a trial-and-error type of approach...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    Static Timing Analysis of Shared Caches for Multicore Processors

    The state-of-the-art techniques in multicore timing analysis are limited to analyze multi-cores with shared instruction caches only. This paper proposes a uniform framework to analyze the worst-case performance for both shared instruction caches and data caches in a multicore platform. The authors' approach is based on a new concept called...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    A Comparative Performance Study for Compute Node Sharing

    The authors introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report their findings. They assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2012

    Equivalence Heuristics for Malleability-Aware Skylines

    In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. In particular, the rise of the semantic web and linked open...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2012

    On-Line Trace Based Automatic Parallelization of Java Programs on Multicore Platforms

    The authors propose two new approaches that automatically parallelize Java programs at runtime. These approaches, which rely on run-time trace information collected during program execution, dynamically recompile Java byte code that can be executed in parallel. One approach utilizes trace information to improve traditional loop parallelization, and the other parallelizes...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2012

    A Dynamic Frequency Controlling Technique for Power Management in Existing Commercial Microcontrollers

    Power continues to be a driving force in Central Processing Units (CPU) design. Most of the advanced breakthroughs in power have been in a realm that is applicable to workstation CPUs. Advanced power management systems will manage temperature, dynamic voltage scaling and dynamic frequency scaling in a CPU. The use...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2012

    Time-Predictable Java Dynamic Compilation on Multicore Processors

    Java has been increasingly used in programming for real-time systems. However, some of Java's features such as automatic memory management and dynamic compilation are harmful to time predictability. If these problems are not solved properly then it can fundamentally limit the usage of Java for real-time systems, especially for hard...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2012

    Multicore-Aware Code Co-Positioning to Reduce WCET on Dual- Core Processors with Shared Instruction Caches

    For real-time systems it is important to obtain the accurate Worst-Case Execution Time (WCET). Furthermore, how to improve the WCET of applications that run on multicore processors is both significant and challenging as the WCET can be largely affected by the possible inter-core interferences in shared resources such as the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jan 2012

    Parallel Multithreaded Processing for Data Set Summarization on Multicore CPUs

    Data mining algorithms should exploit new hardware technology to accelerate computations. Such goal is difficult to achieve in a DBMS due to its complex internal subsystems and because data mining numeric computations on large data sets are difficult to optimize. This paper is to analyze how to take advantage of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Load Shedding for Temporal Queries Over Data Streams

    Enhancing continuous queries over data streams with temporal functions and predicates enriches the expressive power of those queries. While traditional continuous queries retrieve only the values of attributes, temporal continuous queries retrieve the valid time intervals of those values as well. Correctly evaluating such queries requires the coalescing of adjacent...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    A Technique for Fast Process Creation Based on Creation Location

    Due to the proliferation of software parallelization on multi-core CPUs, the number of concurrently executing processes is rapidly increasing. Unlike processes running in a server environment, those executing in a multi-core desktop or a multi-core mobile platform have various correlations. Therefore, it is crucial to consider correlations among concurrently running...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Personalized Battery Lifetime Prediction for Mobile Devices Based on Usage Patterns

    Now-a-days, mobile devices are used for various applications such as making voice/video calls, browsing the Internet, listening to music etc. The average battery consumption of each of these activities and the length of time a user spends on each one determines the battery lifetime of a mobile device. Previous methods...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Data Firewall: A TPM-based Security Framework for Protecting Data in Thick Client Mobile Environment

    Recently, Virtual Desktop Infrastructure (VDI) has been widely adopted to ensure secure protection of enterprise data and provide users with a centrally managed execution environment. However, user experiences may be restricted due to the limited functionalities of thin clients in VDI. If thick client devices like laptops are used, then...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2011

    Privacy Disclosure and Preservation in Learning With Multi-Relational Databases

    There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    Ubiscript: A Script Language for Ubiquitous Environment

    Many distributed and heterogeneous services and devices are accessible in ubiquitous computing environment, so interoperating those services and devices is one of the key tasks in implementing ubiquitous applications. The authors used to use script languages in integrating such interoperating components and services. However, currently available most script languages are...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    An Interference Matrix Based Approach to Bounding Worst-Case Inter-Thread Cache Interferences and WCET for Multi-Core Processors

    Different cores typically share the last-level cache in a multi-core processor. Threads running on different cores may interfere with each other. Therefore, the multi-core Worst-Case Execution Time (WCET) analyzer must be able to safely and accurately estimate the worst-case inter-thread cache interference. This is not supported by current WCET analysis...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    Computing and Reducing Transient Error Propagation in Registers

    Recent research indicates that transient errors will increasingly become a critical concern in microprocessor design. As embedded processors are widely used in reliability-critical or noisy environments, it is necessary to develop cost-effective fault-tolerant techniques to protect processors against transient errors. The register file is one of the critical components that...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2011

    Bounding Worst-Case Performance for Multi-Core Processors With Shared L2 Instruction Caches

    As the first step toward real-time multi-core computing, this paper presents a novel approach to bounding the worst-case performance for threads running on multi-core processors with shared L2 instruction caches. The idea of the authors' approach is to compute the worst-case instruction access interferences between different threads based on the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2011

    Applying Formal Methods to Modeling and Analysis of Real-Time Data Streams

    Achieving situation awareness is especially challenging for real-time data stream applications because they operate on continuous unbounded streams of data and have inherent real-time requirements. In this paper, the authors showed how formal data stream modeling and analysis can be used to better understand stream behavior, evaluate query costs, and...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2010

    Task-Level Dynamic Voltage Scaling for Embedded System Design: Recent Theoretical Results

    It is generally accepted that Dynamic Voltage Scaling (DVS) is one of the most effective techniques of energy minimization for real-time applications in embedded system design. The effectiveness comes from the fact that the amount of energy consumption is quadractically proportional to the voltage applied to the processor. The penalty...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2010

    Static Worst-Case Energy and Lifetime Estimation of Wireless Sensor Networks

    With the advance of computer and communication technologies, Wireless Sensor Networks (WSNs) are increasingly used in many aspects of the people's daily life. However, since the battery lifetime of WSN nodes is restricted, the WSN lifetime is also limited. Therefore, it is crucial to determine this limited lifetime in advance...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2010

    Three Effective Top-Down Clustering Algorithms for Location Database Systems

    Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in location management....

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Feb 2010

    A Survey on Key Management Strategies for Different Applications of Wireless Sensor Networks

    Wireless Sensor Networks (WSN) has proved to be useful in applications that involve monitoring of real-time data. There is a wide variety of monitoring applications that can employ wireless sensor network. Characteristics of a WSN, such as topology and scale, depend upon the application, for which it is employed. Security...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2009

    Bounding Worst-Case Data Cache Performance by Using Stack Distance

    Worst-Case Execution Time (WCET) analysis is critical for hard real-time systems to ensure that different tasks can meet their respective deadlines. While significant progress has been made for WCET analysis of instruction caches, the data cache timing analysis, especially for set-associative data caches, is rather limited. In this paper, the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2009

    Hardware Platforms for Flash Memory/NVRAM Software Development

    Flash memory is increasingly being used in a wide range of storage applications because of its low power consumption, low access latency, small form factor, and high shock resistance. However, the current platforms for flash memory software development do not meet the ever increasing requirements of flash memory applications. This...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2009

    Optimizing Instruction Prefetching to Improve Worst-Case Performance for Real-Time Applications

    While the average-case performance is important for general-purpose applications, worst-case performance is crucial for real-time systems to ensure schedulability and reliability. Recent paper has shown that simple prefetching techniques such as the Next-N-Line prefetching can benefit both average-case and worst-case performance; however, the improvement on the Worst-Case Execution Time (WCET)...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2007

    A Clustered Dwarf Structure to Speed Up Queries on Data Cubes

    Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. The authors all know that the original intention of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2007

    Genomic and Proteomic Databases: Foundations, Current Status and Future Applications

    In this paper, the authors have provided an extensive survey of the databases and other resources related to the current research in bioinformatics and the issues that confront the database researcher in helping the biologists. Initially, they give an overview of the concepts and principles that are fundamental in understanding...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Feb 2010

    A Survey on Key Management Strategies for Different Applications of Wireless Sensor Networks

    Wireless Sensor Networks (WSN) has proved to be useful in applications that involve monitoring of real-time data. There is a wide variety of monitoring applications that can employ wireless sensor network. Characteristics of a WSN, such as topology and scale, depend upon the application, for which it is employed. Security...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2010

    Static Worst-Case Energy and Lifetime Estimation of Wireless Sensor Networks

    With the advance of computer and communication technologies, Wireless Sensor Networks (WSNs) are increasingly used in many aspects of the people's daily life. However, since the battery lifetime of WSN nodes is restricted, the WSN lifetime is also limited. Therefore, it is crucial to determine this limited lifetime in advance...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jan 2012

    Parallel Multithreaded Processing for Data Set Summarization on Multicore CPUs

    Data mining algorithms should exploit new hardware technology to accelerate computations. Such goal is difficult to achieve in a DBMS due to its complex internal subsystems and because data mining numeric computations on large data sets are difficult to optimize. This paper is to analyze how to take advantage of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    Computational Methods for On-Node Performance Optimization and Inter-Node Scalability of HPC Applications

    In the age of multi-core and specialized accelerators in High Performance Computing (HPC) systems, it is critical to understand application characteristics and apply suitable optimizations in order to fully utilize advanced computing system. Often time, the process involves multiple stages of application performance diagnosis and a trial-and-error type of approach...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Energy Aware Scheduling of Aperiodic Real-Time Tasks on Multiprocessor Systems

    Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This paper...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2013

    Counter-Based Approaches for Efficient WCET Analysis of Multicore Processors with Shared Caches

    To enable hard real-time systems to take advantage of multicore processors, it is crucial to obtain the Worst-Case Execution Time (WCET) for programs running on multicore processors. However, this is challenging and complicated due to the inter-thread interferences from the shared resources in a multicore processor. Recent paper used the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2014

    SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

    Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SSDRM is based on...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2012

    Time-Predictable Java Dynamic Compilation on Multicore Processors

    Java has been increasingly used in programming for real-time systems. However, some of Java's features such as automatic memory management and dynamic compilation are harmful to time predictability. If these problems are not solved properly then it can fundamentally limit the usage of Java for real-time systems, especially for hard...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2014

    Comparing Separate and Statically-Partitioned Caches for Time-Predictable Multicore Processors

    In this paper, the authors quantitatively compare two different time-predictable multicore cache architectures, separate and statically-partitioned caches, through extensive simulation. Current research trends primarily focus on partitioned-cache architectures in order to achieve time predictability for hard real-time multicore based systems, and their experiments reveal that separate caches actually lead to...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2010

    Three Effective Top-Down Clustering Algorithms for Location Database Systems

    Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in location management....

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2009

    Hardware Platforms for Flash Memory/NVRAM Software Development

    Flash memory is increasingly being used in a wide range of storage applications because of its low power consumption, low access latency, small form factor, and high shock resistance. However, the current platforms for flash memory software development do not meet the ever increasing requirements of flash memory applications. This...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    Ubiscript: A Script Language for Ubiquitous Environment

    Many distributed and heterogeneous services and devices are accessible in ubiquitous computing environment, so interoperating those services and devices is one of the key tasks in implementing ubiquitous applications. The authors used to use script languages in integrating such interoperating components and services. However, currently available most script languages are...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2009

    Bounding Worst-Case Data Cache Performance by Using Stack Distance

    Worst-Case Execution Time (WCET) analysis is critical for hard real-time systems to ensure that different tasks can meet their respective deadlines. While significant progress has been made for WCET analysis of instruction caches, the data cache timing analysis, especially for set-associative data caches, is rather limited. In this paper, the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2009

    Optimizing Instruction Prefetching to Improve Worst-Case Performance for Real-Time Applications

    While the average-case performance is important for general-purpose applications, worst-case performance is crucial for real-time systems to ensure schedulability and reliability. Recent paper has shown that simple prefetching techniques such as the Next-N-Line prefetching can benefit both average-case and worst-case performance; however, the improvement on the Worst-Case Execution Time (WCET)...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Load Shedding for Temporal Queries Over Data Streams

    Enhancing continuous queries over data streams with temporal functions and predicates enriches the expressive power of those queries. While traditional continuous queries retrieve only the values of attributes, temporal continuous queries retrieve the valid time intervals of those values as well. Correctly evaluating such queries requires the coalescing of adjacent...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2007

    A Clustered Dwarf Structure to Speed Up Queries on Data Cubes

    Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. The authors all know that the original intention of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2014

    Exploiting Standard Deviation of CPI to Evaluate Architectural Time-Predictability

    Time-predictability of computing is critical for hard real-time and safety-critical systems. However, currently there is no metric available to quantitatively evaluate time-predictability, a feature crucial to the design of time-predictable processors. This paper first proposes the concept of architectural time-predictability, which separates the time variation due to hardware architectural/microarchitectural design...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2012

    Equivalence Heuristics for Malleability-Aware Skylines

    In recent years, the skyline query paradigm has been established as a reliable method for database query personalization. While early efficiency problems have been solved by sophisticated algorithms and advanced indexing, new challenges in skyline retrieval effectiveness continuously arise. In particular, the rise of the semantic web and linked open...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2007

    Genomic and Proteomic Databases: Foundations, Current Status and Future Applications

    In this paper, the authors have provided an extensive survey of the databases and other resources related to the current research in bioinformatics and the issues that confront the database researcher in helping the biologists. Initially, they give an overview of the concepts and principles that are fundamental in understanding...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2011

    Privacy Disclosure and Preservation in Learning With Multi-Relational Databases

    There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2011

    Bounding Worst-Case Performance for Multi-Core Processors With Shared L2 Instruction Caches

    As the first step toward real-time multi-core computing, this paper presents a novel approach to bounding the worst-case performance for threads running on multi-core processors with shared L2 instruction caches. The idea of the authors' approach is to compute the worst-case instruction access interferences between different threads based on the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    Static Timing Analysis of Shared Caches for Multicore Processors

    The state-of-the-art techniques in multicore timing analysis are limited to analyze multi-cores with shared instruction caches only. This paper proposes a uniform framework to analyze the worst-case performance for both shared instruction caches and data caches in a multicore platform. The authors' approach is based on a new concept called...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Bounding Worst-Case DRAM Performance on Multicore Processors

    Bounding the worst-case DRAM performance for a real-time application is a challenging problem that is critical for computing Worst-Case Execution Time (WCET), especially for multicore processors, where the DRAM memory is usually shared by all of the cores. Typically, DRAM commands from consecutive DRAM accesses can be pipelined on DRAM...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2012

    Multicore-Aware Code Co-Positioning to Reduce WCET on Dual- Core Processors with Shared Instruction Caches

    For real-time systems it is important to obtain the accurate Worst-Case Execution Time (WCET). Furthermore, how to improve the WCET of applications that run on multicore processors is both significant and challenging as the WCET can be largely affected by the possible inter-core interferences in shared resources such as the...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2012

    A Comparative Performance Study for Compute Node Sharing

    The authors introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report their findings. They assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    A Technique for Fast Process Creation Based on Creation Location

    Due to the proliferation of software parallelization on multi-core CPUs, the number of concurrently executing processes is rapidly increasing. Unlike processes running in a server environment, those executing in a multi-core desktop or a multi-core mobile platform have various correlations. Therefore, it is crucial to consider correlations among concurrently running...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    An Interference Matrix Based Approach to Bounding Worst-Case Inter-Thread Cache Interferences and WCET for Multi-Core Processors

    Different cores typically share the last-level cache in a multi-core processor. Threads running on different cores may interfere with each other. Therefore, the multi-core Worst-Case Execution Time (WCET) analyzer must be able to safely and accurately estimate the worst-case inter-thread cache interference. This is not supported by current WCET analysis...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2011

    Computing and Reducing Transient Error Propagation in Registers

    Recent research indicates that transient errors will increasingly become a critical concern in microprocessor design. As embedded processors are widely used in reliability-critical or noisy environments, it is necessary to develop cost-effective fault-tolerant techniques to protect processors against transient errors. The register file is one of the critical components that...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Personalized Battery Lifetime Prediction for Mobile Devices Based on Usage Patterns

    Now-a-days, mobile devices are used for various applications such as making voice/video calls, browsing the Internet, listening to music etc. The average battery consumption of each of these activities and the length of time a user spends on each one determines the battery lifetime of a mobile device. Previous methods...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2012

    On-Line Trace Based Automatic Parallelization of Java Programs on Multicore Platforms

    The authors propose two new approaches that automatically parallelize Java programs at runtime. These approaches, which rely on run-time trace information collected during program execution, dynamically recompile Java byte code that can be executed in parallel. One approach utilizes trace information to improve traditional loop parallelization, and the other parallelizes...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2013

    Overview of Real-Time Java Computing

    In this paper, the authors present a complete survey of recent techniques that are applied in the field of real-time java computing. It focuses on the issues that are especially important for hard real-time applications, which include time predictable garbage collection, worst-case execution time analysis of java programs, real-time java...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Jun 2012

    A Dynamic Frequency Controlling Technique for Power Management in Existing Commercial Microcontrollers

    Power continues to be a driving force in Central Processing Units (CPU) design. Most of the advanced breakthroughs in power have been in a realm that is applicable to workstation CPUs. Advanced power management systems will manage temperature, dynamic voltage scaling and dynamic frequency scaling in a CPU. The use...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Dec 2011

    Data Firewall: A TPM-based Security Framework for Protecting Data in Thick Client Mobile Environment

    Recently, Virtual Desktop Infrastructure (VDI) has been widely adopted to ensure secure protection of enterprise data and provide users with a centrally managed execution environment. However, user experiences may be restricted due to the limited functionalities of thin clients in VDI. If thick client devices like laptops are used, then...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Sep 2010

    Task-Level Dynamic Voltage Scaling for Embedded System Design: Recent Theoretical Results

    It is generally accepted that Dynamic Voltage Scaling (DVS) is one of the most effective techniques of energy minimization for real-time applications in embedded system design. The effectiveness comes from the fact that the amount of energy consumption is quadractically proportional to the voltage applied to the processor. The penalty...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2011

    Applying Formal Methods to Modeling and Analysis of Real-Time Data Streams

    Achieving situation awareness is especially challenging for real-time data stream applications because they operate on continuous unbounded streams of data and have inherent real-time requirements. In this paper, the authors showed how formal data stream modeling and analysis can be used to better understand stream behavior, evaluate query costs, and...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Mar 2013

    Minimizing the MOLAP/ROLAP Divide: You Can Have Your Performance and Scale It Too

    Over the past generation, data warehousing and On-Line Analytical Processing (OLAP) applications have become the cornerstone of contemporary decision support environments. Typically, OLAP servers are implemented on top of either proprietary array-based storage engines (MOLAP) or as extensions to conventional Relational DBMSs (RDBMS). While MOLAP systems do indeed provide impressive...

    Provided By Korean Institute of Information Scientists and Engineers

  • White Papers // Feb 2013

    Multicore Real-Time Scheduling to Reduce Inter-Thread Cache Interferences

    The Worst-Case Execution Time (WCET) of each real-time task in multicore processors with shared caches can be significantly affected by inter-thread cache interferences. The worst-case inter-thread cache interferences are dependent on how tasks are scheduled to run on different cores. Therefore, there is a circular dependence between real-time task scheduling,...

    Provided By Korean Institute of Information Scientists and Engineers