An Efficient Network System Call Interface supporting minimum memory copy 


Vol. 29,  No. 4, pp. 397-402, Apr.  2004


PDF
  Abstract

In this paper, we have designed and simulated a new file transmission method. This method restricts memory copy and context switching happened in traditional file transmission. This method shows an improved performance than traditional method in network environment.
When the UNIX/LINUX system that uses the existing file transfer technique transmits a packet to the remote system, a memory copy between the user and kernel space occurs over twice at least. Memory copy between the user and kernel space increase a file transmission time and the number of context switching. As a result, the existing file transfer technique has a problem of deteriorating the performance of file transmission.
We propose a new algorithm for solving these problems. It doesn't perform memory copy between the user and kernel space. Hence, the number of memory copy and context switching is limited to the minimum.
We have modified the network related source code of LINUX kernel 2.6.0 to analyzing the performance of proposed algorithm and implement new network system calls.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Song and E. Kim, "An Efficient Network System Call Interface supporting minimum memory copy," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 4, pp. 397-402, 2004. DOI: .

[ACM Style]

Chang-Yong Song and Eun-Gi Kim. 2004. An Efficient Network System Call Interface supporting minimum memory copy. The Journal of Korean Institute of Communications and Information Sciences, 29, 4, (2004), 397-402. DOI: .

[KICS Style]

Chang-Yong Song and Eun-Gi Kim, "An Efficient Network System Call Interface supporting minimum memory copy," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 4, pp. 397-402, 4. 2004.