Browse > Article
http://dx.doi.org/10.9708/jksci.2022.27.04.001

Lock-free unique identifier allocation for parallel macro expansion  

Son, Bum-Jun (Dept. of Computer Engineering, Hannam University)
Ahn, Ki Yung (Dept. of Computer Engineering, Hannam University)
Publication Information
Journal of the Korea Society of Computer and Information / v.27, no.4, 2022 , pp. 1-8 More about this Journal
Abstract
In this paper, we propose a more effective unique identifier allocation method for macro expansion in a single-process multicore parallel computing environment that does not require locks. Our key idea for such an allocation method is to remove sequential dependencies using the remainder operation. We confirmed that our lock-free method is suitable for improving the performance of parallel macro expansion through the following benchmark: we patched an existing library, which is based on a sequential unique identifier allocation, with our proposed method, and compared the performances of the same program but using two different versions of the library, before and after the patch.
Keywords
Unique Identifier; Parallel Processing; Sequential Dependence; Name Binding; Haskell;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 N. Krauter, P. Raaf, P. Braam, R. Salkhordeh, S. Erdweg, and A. Brinkmann, "Persistent software transactional memory in Haskell", Proceedings of the ACM on Programming Languages, Vol. 5, Issue ICFP, August 2021, Article No.: 63, pp. 1-29, DOI : 10.1145/3473568   DOI
2 Paul J. Leach, Michael Mealling, and Rich Salz. "A Universally Unique IDentifier (UUID) URN Namespace", DOI : 10.17487/RFC4122
3 Y. Kim, J. Cheon, M Kim, I. Wang, S. Byun, G. Woo. "A Shared-Memory based Haskell Parallel Programming Model for the Manycore Environments", Proceedings of the Korean Information Science Society Conference, pp. 1554-1556, Korea, June 2021. DOI : 10.5626/KTCP.2017.23.8.459   DOI
4 R. L. Bocchino, V. S. Adve, S. V. Adve, and M. Snir. "Parallel programming must be deterministic by default", HotPar'09: Proceedings of the First USENIX conference on Hot topics in parallelism, March 2009, pp 4.
5 S. Marlow, R. Newton, and S. Peyton Jones, "A monad for deterministic parallelism", Haskell '11: Proceedings of the 4th ACM symposium on Haskell, September 2011, pp. 71-82, DOI : 10.1145/2034675.2034685   DOI
6 K.Y. Ahn, "Deterministic Parallelism for Symbolic Execution Programs based on a Name-Freshness Monad Library", Journal of the Korea Society of Computer and Information, Vol. 26, No. 2, pp. 1-9, Feb 2021. DOI : 10.9708/jksci.2021.26.02.001   DOI
7 H. Kim, H. An, S. Byun, and G. Woo. "Tuning the Performance of Haskell Parallel Programs Using GC-Tune," KIISE Transactions on Computing Practices, 23(8), pp. 459-465, August 2017. DOI : 10.5626/KTCP.2017.23.8.459   DOI
8 S. Weirich, B. A. Yorgey, and Tim Sheard. "Binders unbound," Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011, pp. 333-345, ACM, 2011. DOI: 10.1145/2034574.2034818   DOI
9 E. A. Kmett (maintainer), "unique: Fully concurrent unique identifiers", ver. 0.0.1, 2021-01-04 (revised 2021-11-10), URL: https://hackage.haskell.org/package/unique, accessed 2021-11-25
10 S. Marlow, P. Maier, H.W. Loidl, M. K. Aswad, and P. Trinder, "Seq no more: better strategies for parallel Haskell", ACM SIGPLAN Notices 45(11), November 2010, pp. 91-102, DOI : 10.1145/2088456.1863535   DOI
11 M. Bauer, W. Lee, E. Slaughter, Z. Jia, M. D. Renzo, M. Papadakis, G. Shipman, P. McCormick, M. Garland, and A. Aiken. "Scaling implicit parallelism via dynamic control replication", Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 105-118, Feb 2021. DOI : 10.1145/3437801.3441587   DOI
12 M. Lohstroh, C. Menard, S. Bateni, and E. A. Lee. "Toward a Lingua Franca for Deterministic Concurrent Systems", ACM Trans. Embed. Comput. Syst., Vol. 20, No. 4, pp. 1-27, June 2021. DOI : 10.1145/3448128   DOI
13 J. Swalens, J. D. Koster, and W. D. Meuter, "Chocola: Composable Concurrency Language", ACM Trans. Program. Lang. Syst., Vol. 42, No. 4, pp. 1-56, Feb 2021. DOI : 10.1145/3427201   DOI