• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.459-465
• /
• 2017

Although the performance of computer hardware is increasing due to the development of manycore technologies, software lacking a proportional increase in throughput. Functional languages can be a viable alternative to improve the performance of parallel programs since such languages have an inherent parallelism in evaluating pure expressions without side-effects. Specifically, Haskell is notably popular for parallel programming because it provides easy-to-use parallel constructs based on monads. However, the scalability of parallel programs in Haskell tends to fluctuate as the number of cores increases, and the garbage collector is suspected to be the source of this fluctuations because it affects both the space and the time needed to execute the programs. This paper uses the tuning tool, GC-Tune, to improve the scalability of the performance. Our experiment was conducted with a parallel plagiarism detection program, and the scalability improved. Specifically, the fluctuation range of the speedup was narrowed down by 39% compared to the original execution of the program without any tuning.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2370-2387
• /
• 2000

This paper proposes a new design strategy that can overcome limitations of two existing approaches, focusing on performance and scalability issues among various architectural issues which must be considered in designing workflow systems. In the proposed approach, we suggest to introduce 'delegation model' which corresponds to the high-level strategy utilizing the fundamental characteristics of mobile agents, after establishing a mobile agent-based workflow system architecture focused on performance and scalability. We point out three major issues that should be considered in this approach and propose a 3-tier mobile agent-based workflow system architecture that effectively reflects these considerations. Also, we show that the new approach can provide better performance and scalability than existing ones - approaches based on the client-server paradigm and other approaches based on mobile agent paradigm represented by DartFlow system - by evaluating performance of the proposed architecture through the GSPN simulation.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1487-1497
• /
• 2016

Explosively growing service of digital multimedia data increases the need for highly scalable low-cost storage. This paper proposes the new storage architecture based on torus network which does not need network switch and erasure coding for efficient storage usage for high scalability and efficient disk utilization. The proposed model has to compensate for the disadvantage of long network latency and network processing overhead of torus network. The proposed storage model was compared to two most popular distributed file system, GlusterFS and Ceph distributed file systems through a prototype implementation. The performance of prototype system shows outstanding results than erasure coding policy of two file systems and mostly even better results than replication policy of them.

• Journal of Information Processing Systems
• /
• v.20 no.1
• /
• pp.85-92
• /
• 2024

In recent years, Bitcoin and Ethereum have witnessed a surge in trading activity, driven by venture capital investment and funding through initial coin offerings (ICOs) and initial exchange offerings (IEOs). This heightened interest has led to kickstarting a vibrant ecosystem for blockchain development. The total number of cryptocurrencies listed on CoinMarketCap.com has reached 2,274 highlights how dynamic and wide blockchain development landscape has grown. In blockchain development, new blockchain projects are being created by forking blockchains inspired by major cryptocurrencies such as Bitcoin and Ethereum. These projects aim to address the perceived shortcomings and improve existing technologies. Altcoins, representing these alternative cryptocurrencies, are an ongoing industry effort to improve performance and security with enhancement proposals such as Bitcoin Improvement Proposals (BIP), Ethereum Improvement Proposals (EIP), and EOSIO Enhancement Proposals (EEP). With competitive attempts to improve blockchain performance and security, an ongoing performance race between various blockchains has taken shape, each claiming its own performance advantages. In this paper, we describe the transactions contained in the blocks of each representative blockchain, and find the factors that affect the transactions per second (TPS) through transaction processing and block generation processes, and suggest their relationship with scalability.

• ETRI Journal
• /
• v.27 no.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.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.06a
• /
• pp.205-206
• /
• 2014

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5419-5436
• /
• 2016

Enhancing the performance of computing systems has been an important topic since the invention of computers. The leading-edge technologies of multicore and virtualization dramatically influence the development of current IT systems. We study performance attributes of response time (RT), throughput, efficiency, and scalability of a virtualized Web system running on a multicore server. We build virtual machines (VMs) for a Web application, and use distributed stress tests to measure RTs and throughputs under varied combinations of virtual cores (VCs) and VM instances. Their gains, efficiencies and scalabilities are also computed and compared. Our experimental and analytic results indicate: 1) A system can perform and scale much better by adopting multiple single-VC VMs than by single multiple-VC VM. 2) The system capacity gain is proportional to the number of VM instances run, but not proportional to the number of VCs allocated in a VM. 3) A system with more VMs or VCs has higher physical CPU utilization, but lower vCPU utilization. 4) The maximum throughput gain is less than VM or VC gain. 5) Per-core computing efficiency does not correlate to the quality of VCs or VMs employed. The outcomes can provide valuable guidelines for selecting instance types provided by public Cloud providers and load balancing planning for Web systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.61-64
• /
• 2007

MPLS networks architectures have been prevailed as scalable approach to provide quality of service in the Internet. Many researches have been mainly focused on scalability and multi-path calculation scheme for failure restoration. However, the MPLS network have an scalability problem about traffic, and the existing failure restoration methods are wasted resources, and it has the problem that loss of a packet by a lot of delay occurs in too. Therefore in this paper, we propose a H-MPLS (Hierachical-Multiprotocol Label Switching)network for rapidly failure restorations and effective management of network extended. The proposed H-MPLS Network apply LSP multi-path routing algorithm and consists of several MPLS. After comparing the performance among the existing failure restoration methods with various network models, we use NS simulator in order to analyze the performance. Finally, we present an improvement scheme of the efficiency and scalability.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.188-196
• /
• 2002

As networked virtual environment (NVE) scales in terms of users and network latency, a key aspect to consider is scalability for interactive performance because a large number of objects likely impose heavy burden especially on the network and computational resources. To improve the scalability, various relevance-filtering mechanism have been proposed. However, the existing filtering mechanism do not scale well in terms of interactive performance as the number of users increase and crowds in a specific place. In this paper, we propose a new scalable filtering scheme which reduces the number of messages by dynamically grouping users based on their interests and distance. Within a group, members communicate with each other with high fidelity. However, a representative sends up-to-dated group information of members with low transmission frequency when they are not of immediate interest but are still within the interest area. The representative is elected from members of the group in distributed manner. The proposed scheme enhances the interactive performance scalability of large-scale NVE systems as much as 18% compared with the existing approach.