• Title/Summary/Keyword: Java Memory Model

Search Result 8, Processing Time 0.024 seconds

Verification for Multithreaded Java Code using Java Memory Model (자바 메모리 모델을 이용한 멀티 스레드 자바 코드 검증)

  • Lee, Min;Kwon, Gi-Hwon
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.99-106
    • /
    • 2008
  • Recently developed compilers perform some optimizations in order to speed up the execution time of source program. These optimizations require the reordering of the sequence of program statements. This reordering does not give any problems in a single-threaded program. However, the reordering gives some significant errors in a multi-threaded program. State-of-the-art model checkers such as JavaPathfinder do not consider the reordering resulted in the optimization step in a compiler since they just consider a single memory model. In this paper, we develop a new verification tool to verify Java source program based on Java Memory Model. And our tool is capable of handling the reordering in verifying Java programs. As a result, our tool finds an error in the test program which is not revealed with the traditional model checker JavaPathFinder.

Java Memory Model Simulation using SMT Solver (SMT 해결기를 이용한 자바 메모리 모델 시뮬레이션)

  • Lee, Tae-Hoon;Kwon, Gi-Hwon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.1
    • /
    • pp.62-66
    • /
    • 2009
  • Recently developed compilers perform some optimizations in order to speed up the execution time of source program. These optimizations require the transformation of the sequence of program statements. This transformation does not give any problems in a single-threaded program. However, the transformation gives some significant errors in a multi-threaded program. State-of-the-art model checkers such as Java-Pathfinder do not consider the transformation resulted in the optimization step in a compiler since they just consider a single memory model. In this paper, we describe a new technique which is based on SMT solver. The Java Memory Model Simulator based on SMT Solver can compute all possible output of given multi-thread program within one second which, in contrast, Traditional Java Memory Model Simulator takes one minute.

Design and Analysis of User's Libraries for Parallel Computing based on the Internet (인터넷 기반의 병렬 컴퓨팅을 위한 사용자 라이브러리 설계 및 성능 분석)

  • Sin, Pil-Seop;Jeong, Jun-Mok;Maeng, Hye-Seon;Hong, Won-Gi;Kim, Sin-Deok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2932-2945
    • /
    • 1999
  • As the Internet and Java technology have been growing up, parallel processing approach to utilize those idle resources connected to the Internet has become quite attractive. In this paper, JICE(Java Internet Computing Environment) was implemented as a parallel computing platform based on the Internet using multithreading and RMI mechanisms provided by Java. The basic model of JICE is constructed as three components, such as a client, a set of workers, and a broker. A worker communicates with other workers via a globally shared memory system. It provides users with master-slave programming model and a collection of library functions. The basic model of JICE is also extended as a multimanaging system. This multimanaging system is evaluated by analysis to show its effectiveness. According to numerical analysis and experiments with several benchmarks, it is shown that the performance of basic model depends on the shared memory reference ratio and user's library is a quite promising.

  • PDF

Analysis of the ROMizer of simpleRTJ Embedded Java Virtual Machine (simpleRTJ 임베디드 자바가상기계의 ROMizer 분석 연구)

  • Yang, Hee-jae
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.397-404
    • /
    • 2003
  • Dedicated-purpose embedded Java system usually takes such model that all class files are converted into a single ROM Image by the ROMizer in the host computer, and then the Java virtual machine in the embedded system executes the image. Defining the ROM Image is a very important issue for embedded system with limited memory resource and low-performance processor since the format directly influences on the memory usage and effectiveness of accessing entries in classes. In this paper we have analyzed the ROMizer and especially the format of the ROM image implemented in the simpleRTJ embedded Jana virtual machine. The analysis says that memory space can be saved up to 50% compared to the original class file and access speed exceeds up to six times with the use of the ROMizer. The result of this study will be applied to develop a more efficient ROMizer for a ROM-based embedded Java system.

Architecture of Web-Based Real-Time Monitoring Systems (웹 기반 실시간 모니터링 시스템의 구조)

  • Park, Hong-Seong;Jeong, Myeong-Sun;Kim, Bong-Sun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.7
    • /
    • pp.632-639
    • /
    • 2001
  • This paper proposes an improved architecture of web-based monitoring systems for monitor of processes in plants from the soft real-time point of view. The suggested model is designed to be able to guarantee the temporal and spatial consistency and transmit the monitoring data periodically via the intranet and the Internet. The model generates one thread for monitoring management, one DB thread, one common memory, and corresponding monitoring threads to clients. The monitoring thread is executed during the smaller time than the execution time of the process used in the conventional methods such as CGI and servlet method. The Java API for the server API, VRML, EAI(External Authoring Interface) and Java Applets for efficient dimensional WEB monitoring are used. The proposed model is implemented and tested for a FMS plant, Some examples show that the proposed model is useful one.

  • PDF

Deep Learning Based Security Model for Cloud based Task Scheduling

  • Devi, Karuppiah;Paulraj, D.;Muthusenthil, Balasubramanian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3663-3679
    • /
    • 2020
  • Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

Construction of Product Information Hierarchy for Mobile Clients (모바일 클라이언트를 위한 상품정보 객체계층구조 구성)

  • Ha Sangho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.157-164
    • /
    • 2005
  • With the advances of wireless technologies and mobile computing, m-commerce is being realized on many kinds of mobile devices. Service contents for m-commerce are usually newly written to meet specific characteristics of user's mobile devices, thus requiring formidable efforts. So, it is very important to effectively exploit the Internet product information currently being provided for e-commerce. However, bringing those Internet contents to mobile devices is far from straightforward due to the limitations of mobile devices such as little memory, small displays, low processing speeds, and so forth. In this paper, assuming that the Internet products are represented in XML, we suggest four methods to construct the object hierarchy for effectively viewing the documents on the mobile devices. We then compare and analyze them by experiments in terms of response times and required memory size.