• Title/Summary/Keyword: Computing Resource

Search Result 852, Processing Time 0.026 seconds

A Study of an Mobile Agent System Based on Hybrid P2P (변형 P2P 기반 시스템을 활용한 이동 에이전트 시스템에 관한 연구)

  • Lee, Seok-Hee;Yang, Il-Deung;Kim, Seong-Ryeol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.5
    • /
    • pp.19-28
    • /
    • 2012
  • Recently a grid and cloud computing collaboration have become a social issue. These collaborative network system, the P2P system based on this system. Distingui shed from the client/server systems, P2P systems in order to exchange information, its purpose and functions are divided according to the morphological Category. In accordance with the purposes and functions of information and data retrieval, remote program control and integration services for the offers. Most P2P systems client/server scalability, and management takes the form, but to overcome the disadvantages in terms of applying the mixed-mode system is increasing. And recently the distributed computing aspects of the service to users in order to provide suitable to accommodate the diverse needs of various types of mobile agent technology is needed. In this paper, as required by the mobile agent access to a remote resource access control and agent for the execution and management capabilities and improve the reliability of the mobile agent system designed to suggest.

An Out of Core Linear Direct Solution Method for Large Scale Structural Analysis (대규모 구조해석을 위한 보조기억장치 활용 선형 직접해법)

  • Kim, Min-Ki;Kim, Seung Jo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.42 no.6
    • /
    • pp.445-452
    • /
    • 2014
  • This paper discusses the multifrontal direct solution method with out of core storage for large scale structural analysis in a limited computing resource. Large scale structural analysis requires huge amount of memory space and computation, so out of core solution method is needed in limited computing resource. In this research, out of core multifrontal solution algorithm which utilize the small size of physical memory and minimize the amount of access of low speed out of core storage is introduced. Three ideas, which are stack space in lower trianglar part of square factorization matrix, inverse stack data structure and selective data caching and recovery by data block size, are proposed.

Semantic Grid Management System based on the Ontology of Application Software (응용 프로그램 온톨로지 기반 시맨틱 그리드 관리 시스템)

  • Kim, Min-Sung;Yi, Gwan-Su
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.3
    • /
    • pp.65-75
    • /
    • 2008
  • Grid Computing has enabled enormous amount of computational jobs by connecting distributed computing resources. This technology has developed and widely used in various fields. Previous researches usually focused on how to efficiently manage and use the grid resources. However, there was not enough tries to understand and manage information of application softwares in a well-defined structure. Therefore users in application domain need to how about grid deeply to identify and describe the resource requirements matching for each jobs. We introduce a semantic grid management system based on application ontology to overcome this problem. We design and implement the ontology to store various information of the applications. With the ontology, this system can infer the resource requirements from input parameters and input data of the application software and automatically assign appropriate resources by matching the requirement. Also it can transform the information to other forms which grid middlewares can handle. We apply the system to construct an analysis environment of bioinformatics and compare it with other grid systems to explain usefulness of the system.

  • PDF

An Efficient Protocol for Causal Message Delivery in Distributed Mobile Systems (분산 이동 시스템에서 인과적 메시지 전달을 위한 효율적인 프로토콜)

  • 노성주;정광식;이화민;유헌창;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.143-154
    • /
    • 2003
  • There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

A High Speed 2D-DWT Parallel Hardware Architecture Using the Lifting Scheme (Lifting scheme을 이용한 고속 병렬 2D-DWT 하드웨어 구조)

  • 김종욱;정정화
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.7
    • /
    • pp.518-525
    • /
    • 2003
  • In this paper, we present a fast hardware architecture to implement a parallel 2-dimensional discrete wavelet transform(DWT)based on the lifting scheme DWT framework. The conventional 2-D DWT had a long initial and total latencies to get the final 2D transformed coefficients because the DWT used an entire input data set for the transformation and transformed sequentially The proposed architecture increased the parallel performance at computing the row directional transform using new data splitting method. And, we used the hardware resource sharing architecture for improving the total throughput of 2D DWT. Finally, we proposed a scheduling of hardware resource which is optimized to the proposed hardware architecture and splitting method. Due to the use of the proposed architecture, the parallel computing efficiency is increased. This architecture shows the initial and total latencies are improved by 50% and 66%.

Backlight Control on The PDA by A User's Activity and Posture (사용자의 활동과 자세에 의한 PDA의 백라이트 제어 기법)

  • Baek, Jong-Hun;Yun, Byoung-Ju
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.6
    • /
    • pp.36-42
    • /
    • 2009
  • In the mobile device environment, the context-aware computing has been emerging as a core technology of ubiquitous computing. Compared with a desktop computer, a user interface and resource of mobile device is very limited. Traditional desktop-based user interface has been developed on the basis that a user's activity is static state. In contrast, mobile devices are not able to utilize representative desktop-based interaction mechanisms such as a keyboard and mouse, not only because the activity of a user is dynamic state, but mobile devices have limited resources and small LCD display. In this paper, we introduce an intelligent control system for the mobile device that can utility effectively the limited resource and complement the poor user interface by using an accelerometer being able to sense the physical activity and posture. The proposed system can estimate the user activity, static and dynamic states, and posture watching the PDA at the same time, and the proposed intelligent control system as its application, the backlight ON/OFF on the PDA, is run by the result of the user's behavior.

A Non-Incremental Hierarchical Conference Organization Using Shortest Distance Terminal (최단 거리 단말기를 이용하는 비점진적 계층 회의 구성 방법)

  • Lee, Keonbae
    • Journal of IKEEE
    • /
    • v.18 no.2
    • /
    • pp.248-254
    • /
    • 2014
  • The hierarchical conference causes the data delay because the exchanged data between terminals in the conference go through the hierarchical structure. In this paper, we propose an algorithm which minimizes the average path distance between terminals in a non-incremental hierarchical conference, and which considers the computing resource. For terminals which want to join the ongoing hierarchical conference, our algorithm selects terminals that the new connection is possible among terminals in the conference with the computing resource consideration. Then, after all distance values between the selected terminals and terminals which want to join the ongoing hierarchical conference are computed, and the terminal-pair which have minimum distance value is selected, the ongoing hierarchical conference is extended with a connection of the terminal-pair which consists of a terminal among selected terminals and other terminal among terminals which want to join the ongoing hierarchical conference. This continues until all terminals are included in the conference. As the experimental results with the proposed non-incremental scheme, the hierarchical conference can be organized with 24% better performance than the earlier incremental scheme on the basis of average path distance between terminals.

A Design of Analyzing effects of Distance between a mobile device and Cloudlet (모바일 장치와 구름을 사이에 거리의 효과 분석설계)

  • Eric, Niyonsaba;Jang, Jong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.11
    • /
    • pp.2671-2676
    • /
    • 2015
  • Nowadays, Mobile devices are now capable of supporting a wide range of applications. Unfortunately, some of applications demand an ever increasing computational power and mobile devices have limited resources due to their constraints, such as low processing power, limited memory, unpredictable connectivity, and limited battery life. To deal with mobile devices' constraints, researchers envision extending cloud computing services to mobile devices using virtualization techniques to shift the workload from mobile devices to a powerful computational infrastructure. Those techniques consist of migrating resource-intensive computations from a mobile device to the resource-rich cloud, or server (called nearby infrastructure). In this paper, we want to highlight on cloudlet architecture (nearby infrastructure with mobile devices), its functioning and in our future work, analyze effects of distance between cloudlet and mobile devices.

MCUP: Multi-level Code Updata Protocol for Resource-constrained (MCUP: 자원 제약하의 센서 노드를 위한 다중 수준 코드 갱신 기법)

  • Yi, Sang-Ho;Min, Hong;Kim, Seok-Hyun;Cho, Yoo-Kun;Hong, Ji-Man
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.10b
    • /
    • pp.435-440
    • /
    • 2007
  • Wireless sensor networks are sensing, computing, and communication infrastructures that allow us to sense events in the harsh environment. The networks consist of many deployed sensor nodes. Each sensor node senses and transmits the sensed data to the administrator or base station of the networks. The sensor nodes are generally remotely-deployed, and therefore, software update must be done at run-time via communication channel. The software code update protocol should be energy-efficient to maximize lifetime of the sensor nodes. In this paper, we present a MCUP, which is a multi-level code update protocol for resource-constrained sensor nodes. MCUP enables energy-efficient code update by supporting multi-level code management. Our simulation results show that MCUP can reduce energy consumption compared with the existing one-level code update schemes.

  • PDF

Grid-based Biological Data Mining using Dynamic Load Balancing (동적 로드 밸런싱을 이용한 그리드 기반의 생물학 데이터 마이닝)

  • Ma, Yong-Beom;Kim, Tae-Young;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.81-89
    • /
    • 2010
  • Biological data mining has been noticed as an issue as the volume of biological data is increasing extremely. Grid technology can share and utilize computing data and resources. In this paper, we propose a hybrid system that combines biological data mining with grid technology. Especially, we propose a decision range adjustment algorithm for processing efficiency of biological data mining. We obtain a reliable data mining recognition rate automatically and rapidly through this algorithm. And communication loads and resource allocation are key issues in grid environment because the resources are geographically distributed and interacted with themselves. Therefore, we propose a dynamic load balancing algorithm and apply it to the grid-based biological data mining method. For performance evaluation, we measure average processing time, average communication time, and average resource utilization. Experimental results show that this method provides many advantages in aspects of processing time and cost.