Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

A Technique for Fast Process Creation Based on Creation Location

  • Kim, Byung-Jin (Department of Electronics Computer Engineering, Hanyang University) ;
  • Ahn, Young-Ho (Department of Electronics Computer Engineering, Hanyang University) ;
  • Chung, Ki-Seok (Department of Electronic Engineering, Hanyang University)
  • Received : 2011.07.06
  • Accepted : 2011.08.26
  • Published : 2011.12.30
Download PDF
⟨ Previous Next ⟩

Abstract

Due to the proliferation of software parallelization on multi-core CPUs, the number of concurrently executing processes is rapidly increasing. Unlike processes running in a server environment, those executing in a multi-core desktop or a multi-core mobile platform have various correlations. Therefore, it is crucial to consider correlations among concurrently running processes. In this paper, we exploit the property that for a given created location in the binary image of the parent process, the average running time of child processes residing in the run-queue differs. We claim that this property can be exploited to improve the overall system performance by running processes that have a relatively short running time before those with a longer running time. Experimental results verified that the running time was actually improved by 11%.

Keywords

References

  1. S. H. Fuller and L. I. Millett, "Computing performance: game over or next level?," Computer, vol. 44, no. 1, pp. 31-38, 2011.
  2. B. Catanzaro, A. Fox, K. Keutzer, D. Patterson, S. Bor-Yiing, M. Snir, K. Olukotun, P. Hanrahan, and H. Chafi, "Ubiquitous parallel computing from Berkeley, Illinois, and Stanford," IEEE Micro, vol. 30, no. 2, pp. 41-55, 2010. https://doi.org/10.1109/MM.2010.42
  3. G. Blake, R. G. Dreslinski, T. Mudge, and K. Flautner, "Evolution of thread-level parallelism in desktop applications," Proceedings of the 37th Annual International Symposium on Computer Architecture, Saint-Malo, France, 2010, pp. 302-313.
  4. H. Sutter and J. Larus, "Software and the concurrency revolution," Queue, vol. 3, no. 7, pp. 54-62, 2005.
  5. M. Zhou and A. J. Smith, "Analysis of personal computer workloads," Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, College Park, MD, 1999, pp. 208-217.
  6. T. W. Kim, "Task-level dynamic voltage scaling for embedded system design: recent theoretical results," Journal of Computer Science and Engineering, vol. 4, no. 3, pp. 189-206, 2010. https://doi.org/10.5626/JCSE.2010.4.3.189
  7. J. Yan and W. Zhang, "Bounding worst-case performance for multi-core processors with shared L2 instruction caches," Journal of Computer Science and Engineering, vol. 5, no. 1, pp. 1-18, 2011. https://doi.org/10.5626/JCSE.2011.5.1.001
  8. Y. Liu and W. Zhang, "Bounding worst-case data cache performance by using stack distance," Journal of Computer Science and Engineering, vol. 3, no. 4, pp. 195-215, 2009. https://doi.org/10.5626/JCSE.2009.3.4.195
  9. R. Love, "The Linux scheduling implementation," Linux Kernel Development, 3rd ed., R. Love, Ed., Upper Saddle River, NJ: Addison-Wesley, 2010, pp. 50-61.
  10. "Firefox," http://www.mozilla.org/.
  11. "OpenOffice.org," http://www.openoffice.org/.
  12. A. Taivalsaari, T. Mikkonen, D. Ingalls, and K. Palacz, "Web browser as an application platform: the lively Kernel experience," Proceedings of the 34th Euromicro Conference on Software Engineering and Advanced Applications, Parma, Italy, 2008, pp. 293-302.