• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.5
• /
• pp.1083-1094
• /
• 2020

In this paper, we give some uniqueness theorems of nonconstant meromorphic functions of hyper-order less than one sharing partially three or four small periodic functions with their shifts. As an application, some sufficient conditions for periodicity of meromorphic functions are given. Our results improve and extend previous results of W. Lin, X. Lin and A. Wu [11].

• The Journal of Industrial Distribution & Business
• /
• v.8 no.6
• /
• pp.75-86
• /
• 2017

Purpose - The purpose of this study is to grasp the concept, characteristics and application status of sharing economy, and to derive a research model based on sharing economic service, and to analyze factors and influences of consumers' intention to reuse of sharing economy. Research design, data, and methodology - The questionnaires were created to examine variables for practical and theoretical implications. After pilot survey, conducted for 24 days from March 10th to April 2st in 2017, total numbers were 377. But 330 copies were used for the analysis with IBM SPSS Statistics 23.0 and IBM SPSS AMOS 23.0. The structural equation model was applied for this. Results - First, sharing economic services remain at an early stage, but it is meaningful to identify the revenue mechanism of the business model of the sharing economic platform. Second, in this study, it is meaningful that we systematized the theoretical structure by examining existing studies on the characteristics of the sharing economic service and consumer characteristics, and by examining empirically. Third, Satisfaction and Reliability are related to the characteristics of Sharing Economic Service (Security, Convenience, Discount, Sharing, Social Interaction), Consumer Characteristics (Personal Innovation, Word-of-Mouth) It is meaningful to broaden the understanding of the factors by verifying the mediating effect. Fourth, the sharing economy business is meaningful in that it is a new consumption trend that changes the meaning of consumption to consumers. Gradually, more and more people are recalling that purchasing something is not consumption, but sharing and borrowing is also consumption. In other words, through the sharing economy, consumers can experience more products and services, have more choices, and are expected to have a positive impact on economic growth by increasing the utilization of idle resources. Conclusions - Currently, the sharing economy is growing rapidly all over the world. Therefore, in the subsequent study, it is necessary to compare Korea and China's sharing economy and study the cultural and social characteristics of Korea and China. In particular, I think that steady research is necessary for more precise and specific direction on the influence of the shared economy.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.287-293
• /
• 2012

We introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report our findings. We assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of other users, in that they must compete for processor time in a time-sharing manner and other limited resources such as memory and I/O in a space-sharing manner. Under the assumption, we developed a methodology to simulate job arrivals to a set of compute nodes, and gather and process performance data to calculate the percentage slowdown of parallel jobs. Our goal through this study is to identify a better combination of jobs that minimize performance degradations due to resource sharing and contention. Through our experiments, we found a couple of interesting behaviors for overlapped parallel jobs, which may be used to suggest alternative job allocation schemes aiming to reduce slowdowns that will inevitably result due to resource sharing on a high performance computing cluster. We suggest three job allocation strategies based on our empirical results and propose further studies of the results using a supercomputing facility at the San Diego Supercomputing Center.

• Steel and Composite Structures
• /
• v.12 no.6
• /
• pp.523-540
• /
• 2012

It was clear from the former researches on reinforced concrete filled tubular steel (RCFT) structures that RCFT structures have different performance than concrete filled steel tubular (CFT) structures. However, despite of that, load-sharing ratio of RCFT is evaluating by the formula and range of CFT given by JSCE. Therefore, the aim of this investigation is to study the load-sharing ratio of RCFT columns subjected to axial compressive load by performing numerical simulations of RCFT columns with the nonlinear finite element analysis (FEA) program - ADINA. To achieve this goal, firstly proper material constitutive models for concrete, steel tube and reinforcement are proposed. Then axial compression tests of concrete, RC, CFT, and RCFT columns are carried out to verify proposed material constitutive models. Finally, by the plenty of numerical analysis with small-sized and big-sized columns, load-sharing ratio of RCFT columns was studied, the evaluation formulas and range were proposed, application of the formula was demonstrated, and following conclusions were drawn: The FEA model introduced in this paper can be applied to nonlinear analysis of RCFT columns with reliable results; the load-sharing ratio evaluation formula and range of CFT should not be applied to RCFT; The lower limit for the range of load-sharing ratio of RCFT can be smaller than that of CFT; the proposed formulas for load-sharing ratio of RCFT have practical mean in design of RCFT columns.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.308-315
• /
• 2016

With the advancement in the area of cloud storage services as well as a tremendous growth of social networking sites, permission for one web service to act on the behalf of another has become increasingly vital as social Internet services such as blogs, photo sharing, and social networks. With this increased cross-site media sharing, there is a upscale of security implications and hence the need to formulate security protocols and considerations. Recently, OAuth, a new protocol for establishing identity management standards across services, is provided as an alternative way to share the user names and passwords, and expose personal information to attacks against on-line data and identities. Moreover, OwnCloud provides an enterprise file synchronizing and sharing that is hosted on user's data center, on user's servers, using user's storage. We propose a secure Social Networking Site (SSN) access based on OAuth implementation by combining two novel concepts of OAuth and OwnCloud. Security analysis and performance evaluation are given to validate the proposed scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.965-968
• /
• 2013

In this paper presented car sharing service using eco driving components. The car sharing service is composed of a web service and a smartphone application. The proposed service claims a newly time and fuel consumption based service charge. In order to get the fuel consumption, we used a MAF (Mass Air Flow) of OBD-II data. The application connects the smartphone to the car's OBD-II port through Bluetooth.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.371-378
• /
• 2014

As people are taking part in more versatile social activities, it becomes more frequent and more important for people to share personal information each other in appropriate level. Unfortunately, although the rapid spread of smart devices and advance of network technologies have brought many applications for information sharing into our hands, they do not provide effective mechanism for sharing personal information on collocated people. In this paper, we introduce an android application named WhoAmI which provides the functionality of sharing personal information on nearby users over Wi-Fi Direct as well as Wi-Fi network environment. According to the predefined access level such as business, community or friend, WhoAmI naturally provides profile information to accessible users. In addition, the information such as music, photo, movie can be effectively shared through the application.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.889-891
• /
• 2009

The utilization of robot application is growing up in recent years, but there is a constraint to execute various application on the robot because of difference of robot resource. This paper presents the framework in order to solve the resource constraint by sharing resources with other devices near by robot. The framework defines common factors that are needed to collaboration work. Furthermore, We show the working flow of framework with an example consisted of robot and some devices in same network.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.121-128
• /
• 2002

Although multiprocessor systems are widely used in recent years to run commercial workloads, data sharing patterns are rarely explored due to several difficulties. In this paper, we made in-depth sharing pattern analysis for a representative OLTP application, the TPC-B benchmark, running on a cache-coherent shared-memory multiprocessor system. In addition, to illustrate their effects on the performance, the number of cache misses were measured for various numbers of processors, cache sizes and cache block sizes. From these measurements, we found out the shared data in TPC-B largely bear quite different sharing characteristics from those in scientific applications.