• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (B)
• /
• pp.30-33
• /
• 2006

WSN에서 가장 요구되는 요소들 중 하나인 높은 scalability를 가지는 분산 시스템에서는 WSN의 센서 노드가 능력이 한정되어 있기 때문에, 구현 가능한 경량 알고리즘이 필요하다. Distributed Acoustic 위치판별(DSL) 시스템은 이러한 scalability와 노드 능력에 적합하게 설계되었다. 이벤트 영역은 이벤트를 감지하는 분산 시스템에서의 정확도와 알고리즘의 복잡도에 직결되기 때문에 그 중요성이 WSN에서 더욱 크지만 이 시스템은 이벤트 영역에 대한 고려가 존재하지 않았고, 따라서 DSL 시스템은 성능이 최적화 되지 못하였다. 우리는 DSL에 적합한 이벤트 영역을 정의하여 시스템의 성능을 향상시켰다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3096-3117
• /
• 2013

To execute the performance driven Grid applications, an effective and scalable workflow scheduling is seen as an essential. To optimize cost & makespan, in this paper, we propose a Scalable Cost-Time Trade-off (SCTT) model for scheduling workflow tasks. We have developed a heuristic algorithm known as Scalable Cost-Time Trade-off Scheduling (SCTTS) with a lower runtime complexity based on the proposed SCTT model. We have compared the performance of our proposed approach with other heuristic and meta-heuristic based scheduling strategies using simulations. The results show that the proposed approach improves performance and scalability with different workflow sizes, task parallelism and heterogeneous resources. This method, therefore, outperforms other methods.

• 인터넷정보학회논문지
• /
• 제18권6호
• /
• pp.47-53
• /
• 2017

Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

• ETRI Journal
• /
• 제18권3호
• /
• pp.107-125
• /
• 1996

In this paper, we define the general requirements of ATM switching systems such as scalability, distributed fashion, and modularity. Also we propose a practical implementation of a scalable ATM switching system whose capacity can be easily expanded. Firstly, the architecture of the system is discussed with an emphasis on system scalability, modularity of subsystems and the simple control network of the design requirements. Secondly, we suggest the three types of distributed call/connection control schemes that are suitable for our switching system. We also estimate their call processing capacity on the average and make a comparison of them under the various system architectures. Since our scalable switching system can be constructed to perform the call processing functions on the various levels of the system capacity, it has much adaptability at the various evolution phases or regions of the network environment.

• 디지털융복합연구
• /
• 제7권1호
• /
• pp.175-183
• /
• 2009

With the development of enabling technologies such as wireless networking and various types of hand held-mobile devices, Mobile intelligent agent has been widely applied to various fields. Different views on capabilities, advantages, and disadvantages of mobile intelligent agent providing an ubiquitous access are brought by field researchers and practitioners recently. The purpose of this paper is thus to provide the discussion of the comtemporary development of mobile intelligent agent in the contexts of the Infosphere, focusing especially on developing and nurturing the future research grounds such as information scalability, and information security. The results of this study would improve the applications of mobile intelligent agents in web transaction, especially mobile business surroundings where many interest groups have to adjust their point of issues rapidly due to the changing business environment, i.e., customer's change the order item in web.

• Journal of Information Technology Applications and Management
• /
• 제16권1호
• /
• pp.97-113
• /
• 2009

Collaborative filtering(CF) has been a very successful approach for building recommender system, but its widespread use has exposed to some well-known problems including sparsity and scalability problems. In order to mitigate these problems, we propose two novel models for improving the typical CF algorithm, whose names are ISCF(Item-Selected CF) and USCF(User-Selected CF). The modified models of the conventional CF method that condense the original dataset by reducing a dimension of items or users in the user-item matrix may improve the prediction accuracy as well as the efficiency of the conventional CF algorithm. As a tool to optimize the reduction of a user-item matrix, our study proposes genetic algorithms. We believe that our approach may relieve the sparsity and scalability problems. To validate the applicability of ISCF and USCF, we applied them to the MovieLens dataset. Experimental results showed that both the efficiency and the accuracy were enhanced in our proposed models.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
• /
• pp.795-798
• /
• 2002

본 논문에서는 MPEG-4 표준에서 채택된 FGS(Fine Granualrity Scalability)를 이용한 계층적 비디오 부호화 방법을 적용하였다. MPEG-4 FGS는 인터넷에서 이용되는 다양한 특성의 단말기들과 대역폭 변통에서 유연성 있는 기술이다. 적용된 MPEG-4 FGS 기술은 DCT 기반 비트 평면 부호화를 이용한다. 실험에서는 일반적인 SNR 계층 비디오 코딩(Multi-layered SNR scalable video coding)과의 비교를 통해 FGS의 효율성을 평가한다. 비교는 두 부호화 기술의 PSNR 값의 분석을 가지고 이루어졌고 MPEG-4 FGS 기술이 이전의 다층 SNR계층 비디오 부호화 방법보다 평균 $1\sim2dB$ 정도의 높은 값으로 나타났다. 이를 동해 MPEG-4 FGS가 효율성면에서 다층 SNR계층 비디오 부호화 방법보다 우수함을 알 수 있지만, 단일 계층부호화(Single-layered scalable video coding)에 비해서는 효율성이 낮게 나타났다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (상)
• /
• pp.381-384
• /
• 2002

This paper describes the motivation, design and performance of bi-active Load balancer in Linux Virtual Server. The goal of bi-active Load balancer is to provide a framework to build highly scalable, fault-tolerant services using a large cluster of commodity servers. The TCP/IP stack of Linux Kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster. and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately. Extensive simulation reveals that the proposed approach improves the reply rate about 20% compared to earlier design.

• ETRI Journal
• /
• 제27권4호
• /
• pp.469-472
• /
• 2005

To enhance the scalability of high performance packet switches, a two-stage load-balanced switch has recently been introduced, in which each stage uses a deterministic sequence of configurations. The switch is simple to make scalable and has been proven to provide 100% throughput. However, the load-balanced switch may mis-sequence the packets. In this paper, we propose an algorithm called full frame stuff (FFS), which maintains packet order in the two-stage load-balanced switch and has excellent switching performance. This algorithm is distributed and each port can operate independently.

• ETRI Journal
• /
• 제30권4호
• /
• pp.618-620
• /
• 2008

A distributed virtual environment (DVE) allows multiple geographically distributed objects to interact concurrently in a shared virtual space. Most DVE applications use a non-replicated server architecture, which dynamically partitions a virtual space. An important issue in this system is effective scalability as the number of users increases. However, it is hard to provide suitable load balancing because of the unpredictable movements of users and hot-spot locations. Therefore, we propose a mechanism for sharing roles and separating service regions. The proposed mechanism reduces unnecessary partitions of short duration and supports efficient load balancing.