• Title/Summary/Keyword: user capacity

Search Result 711, Processing Time 0.026 seconds

EXECUTION TIME AND POWER CONSUMPTION OPTIMIZATION in FOG COMPUTING ENVIRONMENT

  • Alghamdi, Anwar;Alzahrani, Ahmed;Thayananthan, Vijey
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.137-142
    • /
    • 2021
  • The Internet of Things (IoT) paradigm is at the forefront of present and future research activities. The huge amount of sensing data from IoT devices needing to be processed is increasing dramatically in volume, variety, and velocity. In response, cloud computing was involved in handling the challenges of collecting, storing, and processing jobs. The fog computing technology is a model that is used to support cloud computing by implementing pre-processing jobs close to the end-user for realizing low latency, less power consumption in the cloud side, and high scalability. However, it may be that some resources in fog computing networks are not suitable for some kind of jobs, or the number of requests increases outside capacity. So, it is more efficient to decrease sending jobs to the cloud. Hence some other fog resources are idle, and it is better to be federated rather than forwarding them to the cloud server. Obviously, this issue affects the performance of the fog environment when dealing with big data applications or applications that are sensitive to time processing. This research aims to build a fog topology job scheduling (FTJS) to schedule the incoming jobs which are generated from the IoT devices and discover all available fog nodes with their capabilities. Also, the fog topology job placement algorithm is introduced to deploy jobs into appropriate resources in the network effectively. Finally, by comparing our result with the state-of-art first come first serve (FCFS) scheduling technique, the overall execution time is reduced significantly by approximately 20%, the energy consumption in the cloud side is reduced by 18%.

P2P Systems based on Cloud Computing for Scalability of MMOG (MMOG의 확장성을 위한 클라우드 컴퓨팅 기반의 P2P 시스템)

  • Kim, Jin-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.1-8
    • /
    • 2021
  • In this paper, we propose an approach that combines the technological advantages of P2P and cloud computing to support MMOGs that allowing a huge amount of users worldwide to share a real-time virtual environment. The proposed P2P system based on cloud computing can provide a greater level of scalability because their more resources are added to the infrastructure even when the amount of users grows rapidly. This system also relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the peers. In this paper, we describe the concept and basic architecture of cloud computing-based P2P Systems for scalability of MMOGs. An efficient and effective provisioning of resources and mapping of load are mandatory to realize this architecture that scales in economical cost and quality of service to large communities of users. Simulation results show that by controlling the amount of cloud and user-provided resource, the proposed P2P system can reduce the bandwidth at the server while utilizing their enough bandwidth when the number of simultaneous users keeps growing.

Appraisal Method for Similarity of Large File Transfer Software (대용량 파일 전송 소프트웨어의 동일성 감정 방법)

  • Chun, Byung-Tae
    • Journal of Software Assessment and Valuation
    • /
    • v.17 no.1
    • /
    • pp.11-16
    • /
    • 2021
  • The importance of software is increasing due to the development of information and communication, and software copyright disputes are also increasing. In this paper, the source of the submitted programs and the files necessary for the execution of the program were taken as the scope of analysis. The large-capacity file transfer solution program to be analyzed provides additional functions such as confidentiality, integrity, user authentication, and non-repudiation functions through digital signature and encryption of data.In this paper, we analyze the program A, program B, and the program C. In order to calculate the program similarity rate, the following contents are analyzed. Analyze the similarity of the package structure, package name, source file name in each package, variable name in source file, function name, function implementation source code, and product environment variable information. It also calculates the overall similarity rate of the program. In order to check the degree of agreement between the package structure and the package name, the similarity was determined by comparing the folder structure. It also analyzes the extent to which the package structure and package name match and the extent to which the source file (class) name within each package matches.

GPU Memory Management Technique to Improve the Performance of GPGPU Task of Virtual Machines in RPC-Based GPU Virtualization Environments (RPC 기반 GPU 가상화 환경에서 가상머신의 GPGPU 작업 성능 향상을 위한 GPU 메모리 관리 기법)

  • Kang, Jihun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.5
    • /
    • pp.123-136
    • /
    • 2021
  • RPC (Remote Procedure Call)-based Graphics Processing Unit (GPU) virtualization technology is one of the technologies for sharing GPUs with multiple user virtual machines. However, in a cloud environment, unlike CPU or memory, general GPUs do not provide a resource isolation technology that can limit the resource usage of virtual machines. In particular, in an RPC-based virtualization environment, since GPU tasks executed in each virtual machine are performed in the form of multi-process, the lack of resource isolation technology causes performance degradation due to resource competition. In addition, the GPU memory competition accelerates the performance degradation as the resource demand of the virtual machines increases, and the fairness decreases because it cannot guarantee equal performance between virtual machines. This paper, in the RPC-based GPU virtualization environment, analyzes the performance degradation problem caused by resource contention when the GPU memory requirement of virtual machines exceeds the available GPU memory capacity and proposes a GPU memory management technique to solve this problem. Also, experiments show that the GPU memory management technique proposed in this paper can improve the performance of GPGPU tasks.

Traffic-Oriented Stream Scheduling for 5G-based D2D Streaming Services

  • Lee, Chong-Deuk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.10
    • /
    • pp.95-103
    • /
    • 2022
  • As 5G mobile communication services gradually expand in P2P (peer-to-peer) or D2D (device-to-device) applications, traffic-oriented stream control such as YouTube streaming is emerging as an important technology. In D2D communication, the type of data stream most frequently transmitted by users is a video stream, which has the characteristics of a large-capacity transport stream. In a D2D communication environment, this type of stream not only provides a cause of traffic congestion, but also degrades the quality of service between D2D User Equipments (DUEs). In this paper, we propose a Traffic-Oriented Stream Scheduling (TOSS) scheme to minimize the interruption of dynamic media streams such as video streams and to optimize streaming service quality. The proposed scheme schedules the media stream by analyzing the characteristics of the media stream and the traffic type in the bandwidth of 3.5 GHz and 28 GHz under the 5G gNB environment. We examine the performance of the proposed scheme through simulation, and the simulation results show that the proposed scheme has better performance than other comparative methods.

Modified p-y curves to characterize the lateral behavior of helical piles

  • Hyeong-Joo, Kim;James Vincent, Reyes;Peter Rey, Dinoy;Tae-Woong, Park;Hyeong-Soo, Kim;Jun-Young, Kim
    • Geomechanics and Engineering
    • /
    • v.31 no.5
    • /
    • pp.505-518
    • /
    • 2022
  • This study introduces soil resistance multipliers at locations encompassed by the zone of influence of the helix plate to consider the added lateral resistance provided to the helical pile. The zone of influence of a helix plate is a function of its diameter and serves as a boundary condition for the modified soil resistance springs. The concept is based on implementing p-multipliers as a reduction factor for piles in group action. The application of modified p-y springs in the analysis of helical piles allows for better characterization and understanding of the lateral behavior of helical piles, which will help further the development of design methods. To execute the proposed method, a finite difference program, HPCap (Helical Pile Capacity), was developed by the authors using Matlab. The program computes the deflection, shear force, bending moment, and soil resistance of the helical pile and allows the user to freely input the value of the zone of influence and Ω (a coefficient that affects the value of the p-multiplier). Results from ten full-scale lateral load tests on helical piles embedded at depths of 3.0 m with varying shaft diameters, shaft thicknesses, and helix configurations were analyzed to determine the zone of influence and the magnitude of the p-multipliers. The analysis determined that the value of the p-multipliers is influenced by the ratio between the pile embedment length and the shaft diameter (Dp), the effective helix diameter (Dh-Dp), and the zone of influence. Furthermore, the zone of influence is recommended to be 1.75 times the helix diameter (Dh). Using the numerical analysis method presented in this study, the predicted deflections of the various helical pile cases showed good agreement with the observed field test results.

Analysis on the Performance Elements of Web Server Cluster Systems (웹서버 클러스터 시스템의 성능 요소 분석)

  • Park, Jin-Won
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.91-98
    • /
    • 2010
  • This paper is on the research result for analyzing the performance of GLORY(GLobal Resource management sYstem) used for Web Server Cluster system, which was developed at ETRI(Electronic and Telecommunication Research Institute). The paper includes the definition of Web Server Cluster System, the characteristics of the system, user oriented system performance, current performance enhancement methods, computer simulation model for GLORY and its experimental results for the performance of GLORY. GLORY is composed of 2048~1,000,000 units of PCs, and is used for Internet servers. From the results of the simulation experiments, we notice that GLORY has enough capacity to fully serve the appropriate level of Internet services. Also, the results show that Web server service time is longer than that for network transmission time but requires more DNS than expected, and that 100Mbps LAN is good enough for directly connecting Internet to the Web servers while not affecting the total system performance.

A Program Development for Prediction of Negative Skin Friction on Piles by Consolidation Settlement (압밀침하를 고려한 말뚝의 부마찰력 예측 프로그램 개발)

  • Kim, Hyeong-Joo;Mission, Jose Leo C.
    • Journal of the Korean Geotechnical Society
    • /
    • v.25 no.9
    • /
    • pp.5-17
    • /
    • 2009
  • The microcomputer program PileNSF (Pile Negative Skin Friction) is developed by the authors in a graphical user interface (GUI) environment using $MATLAB^{(R)}$ for predicting the bearing capacity of a pile embedded in a consolidating ground by surcharge loading. The proposed method extends the one-dimensional soil-pile model based on the nonlinear load transfer method in OpenSees to perform an advanced one-dimensional consolidation settlement analysis based on finite strain. The developed program has significant features of incorporating Mikasa's finite strain consolidation theory that accounts for reduction in the thickness of the clay layer as well as the change of the soil-pile interface length during the progress of consolidation. In addition, the consolidating situation of the ground by surcharge filling after the time of pile installation can also be considered in the analysis. The program analysis by the presented method has been verified and validated with several case studies of long-term test on single piles subjected to negative skin friction. Predicted results of negative skin friction (downdrag and dragload) as a result of long from consolidation settlement are shown to be in good agreement with measured and observed case data.

Diverse modeling techniques, parameters, and assumptions for nonlinear dynamic analysis of typical concrete bridges with different pier-to-deck connections: which to use and why

  • Morkos, B.N.;Farag, M.M.N.;Salem, S.;Mehanny, S.S.F.;Bakhoum, M.M.
    • Earthquakes and Structures
    • /
    • v.22 no.3
    • /
    • pp.245-261
    • /
    • 2022
  • Key questions to researchers interested in nonlinear analysis of skeletal structures are whether the distributed plasticity approach - albeit computationally demanding - is more reliable than the concentrated plasticity to adequately capture the extent and severity of the inelastic response, and whether force-based formulation is more efficient than displacement-based formulation without compromising accuracy. The present research focusing on performance-based seismic response of mid-span concrete bridges provides a pilot holistic investigation opting for some hands-on answers. OpenSees software is considered adopting different modeling techniques, viz. distributed plasticity (through either displacement-based or force-based elements) and concentrated plasticity via beam-with-hinges elements. The pros and cons of each are discussed based on nonlinear pushover analysis results, and fragility curves generated for various performance levels relying on incremental dynamic analyses under real earthquake records. Among prime conclusions, distributed plasticity modeling albeit inherently not relying on prior knowledge of plastic hinge length still somewhat depends on such information to ensure accurate results. For instance, displacement-based and force-based approaches secure optimal accuracy when dividing, for the former, the member into sub-elements, and satisfying, for the latter, a distance between any two consecutive integration points, close to the expected plastic hinge length. On the other hand, using beam-with-hinges elements is computationally more efficient relative to the distributed plasticity, yet with acceptable accuracy provided the user has prior reasonable estimate of the anticipated plastic hinge length. Furthermore, when intrusive performance levels (viz. life safety or collapse) are of concern, concentrated plasticity via beam-with-hinges ensures conservative predicted capacity of investigated bridge systems.

Analysis on Time Dependent Traffic Volume Characteristics on Highways linked to Recreation Areas (관광지 종류별 일반국도 교통량의 시간별 특성 연구)

  • Kim, Yun Seob;Oh, Ju Sam;Kim, Hyun Seok
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.1D
    • /
    • pp.23-30
    • /
    • 2006
  • The variation in the traffic volume on any given roads is the reflection of its user's economic activities and life patterns. And traffic volume flows in every hour usually take different charateristics depending on the location and the function of the roads. This study produced the Monthly Adjustment Factor, Weekly Adjustment Factor and Design hourly Factor, each of which is the index indicating the traffic volume charaterirstics on the highways leading to the recreation areas in the mountainous and seaside tourist sites. Applying these results, it might be possible to calculate the optimal AADT (Annual Average Daily Traffic) and DHV (Design Hour Volume), also be a help to establish a traffic management policy. Finally, it hopes to promote new version of KHCM (Korea Highway Capacity Manual) which includes traffic volume characteristics on recreation areas.