IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i14p3175-d1197839.html
   My bibliography  Save this article

A Novel Memory Concurrent Editing Model for Large-Scale Video Streams in Edge Computing

Author

Listed:
  • Haitao Liu

    (Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
    Office of Information, Linyi University, Linyi 276002, China)

  • Qingkui Chen

    (Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
    School of Optical-Electrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China)

  • Puchen Liu

    (Department of Statistics, Shanghai Polytechnic University, Shanghai 201209, China)

Abstract

Efficient management and utilization of edge server memory buffers are crucial for improving the efficiency of concurrent editing in the concurrent editing application scenario of large-scale video in edge computing. In order to elevate the efficiency of concurrent editing and the satisfaction of service users under the constraint of limited memory buffer resources, the allocation of memory buffers of concurrent editing servers is transformed into the bin-packing problem, which is solved using an ant colony algorithm to achieve the least loaded utilization batch. Meanwhile, a new distributed online concurrent editing algorithm for video streams is designed for the conflict problem of large-scale video editing in an edge computing environment. It incorporates dual-buffer read-and-write technology to solve the difficult problem of concurrent inefficiency of editing and writing disks. The experimental results of the simulation show that the scheme not only achieves a good performance in the scheduling of concurrent editing but also implements the editing resource allocation function in an efficient and reasonable way. Compared with the benchmark traditional single-exclusive editing scheme, the proposed optimized scheme can simultaneously enhance editing efficiency and user satisfaction under the restriction of providing the same memory buffer computing resources. The proposed model has a wide application to video real-time processing application scenarios in edge computing.

Suggested Citation

  • Haitao Liu & Qingkui Chen & Puchen Liu, 2023. "A Novel Memory Concurrent Editing Model for Large-Scale Video Streams in Edge Computing," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:14:p:3175-:d:1197839
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/14/3175/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/14/3175/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:14:p:3175-:d:1197839. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.