• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.488-496
• /
• 2000

this paper describes the design and implementation of node scheduling for MX Server that is CC-NUMA System COMSIX, the operating system of MX Server, is designed to suit for CC-NUMA Architecture. MX Server consists of up to 8 nodes, and each node is connected by SCI ring. This node scheduling scheme considers data locality for performance improvement of Oracle8i DBMS on the CC-NUMA architecture. For DBMS such as Oracle8i, a multi-threaded process may be run to tie on particular disk. We have developed a CG binding function that the multi-threaded process bound the node. Currently, We don't have an available CC-NUMA Platform. Instead of MX Server, we developed the Node scheduling scheme for multi-threaded process to suit server platform on the PC test-bed and tested completely.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1346-1351
• /
• 2009

In this paper we propose a framework for an Object Relational IFC Server (OR-IFC Server). Enormous amounts of information are generated in each project. Today, many BIM systems are developed by various CAD software vendors. Industry Foundation Classes (IFC) developed by International Alliance for Interoperability (IAI) is an open standard data model for exchanging data between the various BIM tools. The IFC provides a foundation for exchanging and sharing of information directly between software applications and define a shared building project model. The IFC model server is a database management system that can keep track of transactions, modifications, and deletions. It plays a role as an information hub for storing and sharing information between various parties involved in construction projects. Users can communicate with each other via the internet and utilize functions implemented in the model server such as partial data import/export, file merge, version control, etc. IFC model servers using relational database systems have been developed. However, they suffered from slow performance and long transaction time due to a complex mapping process between the IFC structure and a relational-database structure because the IFC model schema is defined in the EXPRESS language which is object-favored language. In order to simplify the mapping process, we developed a set of rules to map the IFC model to an object-relational database (ORDB). Once the database has been configured, only those pieces of information that are required for a specific information-exchange scenario are extracted using the pre-defined information delivery manual (IDM). Therefore, file sizes will be reduced when exchanging data, meaning that files can now be effectively exchanged and shared. In this study, the framework of the IFC server using ORDB and IDM and the method to develop it will be examined.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.550-558
• /
• 2001

Although the web is becoming a widely accepted medium, it provides relatively poor performance and low availability. A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. In this paper, we propose a load balancer architecture under the web server cluster that provides high-availability, high performance and scalability. In addtion, we propose an efficient load balancing algorithm that considers access rate and size of documents. Specially, our algorithm does not require the nodes running under similar configurations and the same operating system. Also, server cache can be utilized more efficiently.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.75-81
• /
• 2012

In this paper, we design and implementation of effective integrated broadcast contents transmission System based on single server system. Because of previous broadcast contents transmission system is consist of various individual functional equipment. And it is not easy to use and not effective to manage for broadcast contents transmission. In this paper, we evaluated and analysed of developed system in the test environment. As a result of performance test, It showed that it was well performed without any data error in the performance test, and It showed that it was well managed, controled, scheduled, processed of the integrated broadcast contents transmission environment.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.32-39
• /
• 2016

With the help of a small wearable device, patients reside in an isolated village need constant monitoring which may increase access to care and decrease healthcare delivery cost. As the number of patients' requests increases in simultaneously manner, the web service gateway located in the village hall encounters limitations for performing them successfully and concurrently. The gateway based RESTful technology responsible for handling patients' requests attests an internet latency in case a large number of them submit toward the gateway increases. In this paper, we propose the design tasks of the web service gateway for handling concurrency events. In the procedure of designing tasks, concurrency is best understood by employing multiple levels of abstraction. The way that is eminently to accomplish concurrency is to build an object-oriented environment with support for messages passing between concurrent objects. We also investigate the performance of event-driven architecture for building web service gateway using node.js. The experiments results show that server-side JavaScript with Node.js and MongoDB as database is 40% faster than Apache Sling. With Node.js developers can build a high-performance, asynchronous, event-driven healthcare hub server to handle an increasing number of concurrent connections for Remote Healthcare Monitoring System in an isolated village with no access to local medical care.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.2
• /
• pp.227-234
• /
• 2002

An cluster web server system, one has the problem that does the low availability occured by the high chance of the server failures and it is not easy to provide high performance and availability occuring software aging. In this paper, running cluster web sewers consists of n primary servers and k backup servers, propose software rejuvenation model on performance and switchover time. Based on the various system operational parameters, we calculate to evaluate the rejuvenation policy such steady-state probabilities, availability, and downtime cost. And we validate the solutions of mathematical model by experiments based on various operation parameters and fud that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.11-15
• /
• 2015

SSD(Solide State Disk) Memory is gradually replacing HDD(Hard Disk Drive) for high speed data input and output processing on Internet server system. In this paper, we proposed efficient data distribution storage algorithm in DRAM based SSD. And we did performance test for proposed algorithm and existing algorithm in the same server environment condition. The result of comparison of performance test is as fellows. Data backup processing time of proposed algorithm was reduced by half than that of existing algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.469-476
• /
• 2016

Relational Database Management Systems have become de facto database model among most developers and users since the inception of Data Science. From IoT devices, sensors, social media and other sources, data is generated in structured, semi-structured and unstructured formats, in huge volumes, thereby the difficulty of data management greatly increases. Organizations that collect large amounts of data are increasingly turning to non relational databases - NoSQL databases. In this paper, through experiments with real field data, we demonstrate that MongoDB, a document-based NoSQL database, is a better alternative for building a Telco Subscriber Data Management System which hitherto is mainly built with Relational Database Management Systems. We compare the existing system in various phases of data flow with our proposed system powered by MongoDB. We show how various workloads at some phases of the existing system were either completely removed or significantly simplified on the new system. Based on experiment results, using MongoDB for managing telco subscriber data turned out to offer performance better than the existing system built with MSSQL Server.

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.13-20
• /
• 2003

As it increase electronic commerce user rapidly, it is necessary to study on Improvement of performance for electronic commerce system. This paper suggests electronic commerce system using functionally distributed structure based on multi-agent and evaluate it's performance using prototype. In the suggested system, we use multi-agent using combined reasoning to offer a proper commodity information and meet the customer's requirement. And we can reduce load of the electronic commerce system with distribute agents both main server system and local server system functionally. In experiment result, we can confirm suggested electronic commerce system can prevent customer's unexpected long waiting causes by network traffic and server load, and can improve efficiency.