• 한국정보처리학회논문지
• /
• 제7권4호
• /
• pp.1082-1091
• /
• 2000

In Distributed Shared Memory systems, false sharing occurs when two different data items, not shared but accessed by two different processors, are allocated to a single block and is an important factor in degrading system performance. The paper first analyzes shared memory allocation and reference patterns in parallel applications that allocate memory for shared data objects using a dynamic memory allocator. The shared objects are sequentially allocated and generally show different reference patterns. If the objects with the same size are requested successively as many times as the number of processors, each object is referenced by only a particular processor. If the objects with the same size are requested successively much more than the number of processors, two or more successive objects are referenced by only particular processors. On the basis of these analyses, we propose a memory allocation scheme which allocates each object requested by different processors to different pages and evaluate the existing memory allocation techniques for reducing false sharing faults. Our allocation scheme reduces a considerable amount of false sharing faults for some applications with a little additional memory space.

• 한국정보과학회논문지:시스템및이론
• /
• 제27권6호
• /
• pp.583-591
• /
• 2000

캐슁 기법은 저장 장치 계층 간의 속도차를 완충시키기 위해 캐쉬 메모리, 페이징 기법, 버퍼링 기법 등으로 널리 연구되어 왔다. 하지만, 최근 웹을 비롯한 다양한 광역 분산 환경의 보편화에 따라 단일 시스템 내의 저장 장치 간에 이루어지는 캐슁 기법 뿐 아니라 타 노드의 객체를 캐슁하는 기법의 중요성이 커지고 있다. 광역 분산 환경에서의 캐슁 기법은 객체의 캐슁에 드는 비용과 캐슁으로 인한 이득이 객체의 근원지 노드의 위치에 따라 이질적이기 때문에 비용 차이를 고려한 캐쉬 교체 알고리즘이 필요하다. 한편, 캐쉬 교체 알고리즘은 온라인 알고리즘으로서 매 시점 교체 대상이 되는 객체를 즉시 선택해야 하기 때문에 알고리즘의 시간 복잡도가 지나치게 높지 않아야 한다. 그러나, 광역 분산 환경에서의 교체 알고리즘에 대한 지금까지의 연구는 객체들의 이질성을 고려하는 문제와 캐쉬 운영의 시간 복잡도 측면 모두에서 만족스러운 결과를 보이지는 못하고 있다. 본 논문은 이러한 점을 극복하여 우수한 성능을 나타내면서 효율적인 구현이 가능한 새로운 교체 알고리즘을 설계하고, 그 우수성을 트레이스 기반 모의 실험을 통해 보여 준다.

• International Journal of Contents
• /
• 제11권1호
• /
• pp.69-72
• /
• 2015

Generally, existing parallel main-memory spatial index structures to avoid the trade-off between query freshness and CPU cost uses light-weight locking techniques. However, still, the lock based methods have some limits such as thrashing which is a well-known problem in lock based methods. In this paper, we propose a distributed index structure for moving objects exploiting the parallelism in multiple machines. The proposed index is a lock free multi-version concurrency technique based on the D-Stream model of Spark Stream. The proposed method exploits the multiversion nature of D-Stream of Spark Streaming.

• 디지털콘텐츠학회 논문지
• /
• 제9권4호
• /
• pp.785-790
• /
• 2008

디지털 캐로절은 사용자들에게 미디어 동기화 메카니즘을 통하여 미디어 객체 공유를 가능하게 한다. 본 시스템은 공동 작업에 참여한 사용자들이 다른 참여자들에게 같은 뷰로써 공유된 미디어 또는 오류 객체들을 참조할 수 있도록 구축한다. 본 논문에서는 결함 허용을 통하여 신뢰성을 향상시키는 방법에 대해서 기술한다. ER은 분산 멀티미디어에서 하나의 소프트웨어 오류를 자동적으로 복구할 수 있는 시스템이다. 본 논문은 규칙-기반 DEVS(Discrete Event System Specification) 모델링과 시뮬레이션 기법을 사용하면서 분산 멀티미디어 상에서의 오류 복구 시스템의 성능 분석을 설명한다. DEVS에서 하나의 시스템은 시간, 입력, 상태, 출력 및 함수들을 가지고 있다.

• Asia pacific journal of information systems
• /
• 제8권3호
• /
• pp.21-36
• /
• 1998

Group collaborative systems are recently emerging to support a group of users engaged in common tasks such as group decision making, engineering design, or collaborative writing. Simultaneously, as communications networks and distributed database systems become core underlying architecture of the organization, the need of collaborative systems are gaining more attentions from industry. In such collaborative systems, as the shared objects may evolve constantly or change for operational purposes, providing the users with synchronized and consistent views of the shared object and maintaining the consistency between shared object and replicated objects are important to improve the overall productivity. This paper provides an change management framework for the group collaborative systems to facilitate managing dependency relationships between shared objects and dependents, and coordinating change and propagation activities in distributed computing environments. Specifically, the framework adopts an object-oriented database paradigm and presents several object constructs capturing dependency management and change notification mechanisms. And the proposed framework accommodates both persistent dependents such as replicated data and transient dependents such as various user views in a single formalism. A prototype system is developed on a commercial object-oriented database management system called OBJECTSTORE using the C++ programming language.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2012년도 학술발표회
• /
• pp.35-35
• /
• 2012

Most grid-based distributed hydrologic models are complex in terms of data requirements, parameter estimation and computational demand. To address these issues, a simple grid-based hydrologic model is developed in a geographic information system (GIS) environment using storage-release concept. The model is named GIS Storage Release Model (GIS-StoRM). The storage-release concept uses the travel time within each cell to compute howmuch water is stored or released to the watershed outlet at each time step. The travel time within each cell is computed by combining the kinematic wave equation with Manning's equation. The input to GIS-StoRM includes geospatial datasets such as radar rainfall data (NEXRAD), land use and digital elevation model (DEM). The structural framework for GIS-StoRM is developed by exploiting geographic features in GIS as hydrologic modeling objects, which store and process geospatial and temporal information for hydrologic modeling. Hydrologic modeling objects developed in this study handle time series, raster and vector data within GIS to: (i) exchange input-output between modeling objects, (ii) extract parameters from GIS data; and (iii) simulate hydrologic processes. Conceptual and structural framework of GIS StoRM including its application to Pleasant Creek watershed in Indiana will be presented.

• 한국정보처리학회논문지
• /
• 제7권4호
• /
• pp.1062-1072
• /
• 2000

The applications developing in distributed object computing enviroments are faced with the difficulties for managing various lots of distributed objects. Also, because the most multimedia service, like video, audio, and so forth, must be satisfied itself with real-time constraints, the users also are feeling with necessary to apply real-time mechanisms to distributed multimedia services. The goal of this paper is to solve the problems for managing distributed objects, and to be easy to develop complex applications that can provide real-time services. To do this, we designed and implemented a real-time object group platform that can be placed between applications and CORBA. This platform is extended the existing object group model[13,14] added to the scheduler and timer object components for supporting real-time concept. We designed the components for platform by using James Rumbaugh object modeling technology that consists of object, function, and dynamic model. And then we described the detailed interfaces of the components by IDL, and implemented our real-time object group's platform using OrbixMT 22 which is the IONA Technologies' ORB product. Finally, we showed the execution procedures of the schduler object of each components in a real-time object group platform.

• Journal of Communications and Networks
• /
• 제17권6호
• /
• pp.558-567
• /
• 2015

In recent years, we have seen a proliferation of mobile-network-enabled smart objects, such as smart-phones and smart-watches, that form a cyber-physical integrated network to connect the cyber and physical worlds through the capabilities of sensing, communicating, and computing. Discovery of the relationship between smart objects is a critical and nontrivial task in cyber-physical integrated network applications. Aiming to find the most stable relationship in the heterogeneous and dynamic cyber-physical network, we propose a distributed and efficient relationship-discovery algorithm, called dynamically maximizing remaining unchanged time with minimum connected dominant set (DMRUT-MCDS) for constructing a backbone with the smallest scale infrastructure. In our proposed algorithm, the impact of the duration of the relationship is considered in order to balance the size and sustain time of the infrastructure. The performance of our algorithm is studied through extensive simulations and the results show that DMRUT-MCDS performs well in different distribution networks.

• 산업공학
• /
• 제15권1호
• /
• pp.10-19
• /
• 2002

New trends such as electronic commerce, virtual organizations, e-business applications, etc. increase the dependence of production management on information software systems and contribute to the needs for global, distributed object systems. This paper presents a component based approach for production management systems under the multi-tier distributed information system architecture using UML(Unified Modeling Language), CORBA(Common Object Request Broker Architecture) and XML(eXtensible Markup Language) technologies, and propose rules for mapping a UML class diagram to a XML DTD (Document Type Definition). And we adapt it to the prototype system implementation. The components are implemented by CORBA and we use XML messages for the information exchange between components.

• 한국정보통신학회논문지
• /
• 제6권6호
• /
• pp.856-862
• /
• 2002

The object-oriented(00) distributed real-time(RT) programming movement started in1990's and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented(00) RT programming scheme is called the time-triggered message triggered object(TMO)programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.