Умножение матриц в Common Lisp и Параллельные вычисления какие есть подходящие библиотеки

[package numcl.exported]
Detected that SBCL's dynamic-space-size is 1073.7418MB, less than 2000MB.
Numcl requires a relatively large large heap. Retry with a larger heap if it failed.
.................
; Discarding the grounding result with 322 clauses; more than 300 clauses.
....
; Discarding the grounding result with 551 clauses; more than 300 clauses.
..
; Discarding the grounding result with 551 clauses; more than 300 clauses.
..
; Discarding the grounding result with 570 clauses; more than 300 clauses.
.
.
; Discarding the grounding result with 570 clauses; more than 300 clauses.
.................................................
...................................
; inlining (MATMUL ACC M).
; inlining (MATMUL (PROCESS-TREE (FIRST TREE)) (PROCESS-TREE (SECOND TREE)))..
; inlining (MATMUL (REC I K) (REC (1+ K) J))............
..................................................
............................................

(ql:quickload 'lparallel)
 
(lparallel:defpun paral-test ()
  (lparallel:pmapcar 'expt
            (loop for i from 1 to 100000)
            (loop for i from 1 to 100000)))
(defun paral-test-2 ()
  (mapcar 'expt
      (loop for i from 1 to 100000)
          (loop for i from 1 to 100000)))
 
(defun paral-test-3 ()
  (lparallel:pmapcar 'expt
            (loop for i from 1 to 100000)
            (loop for i from 1 to 100000)))

(progn (time (paral-test)) (time (paral-test-2)) (time (paral-test-3)))

(lparallel:defpun paral-test (n)
  (lparallel:pmapcar #'(lambda (a) (expt 2 a))
            (loop for i from 1 to n collect i)))
 
(defun paral-test-2 (n)
  (mapcar #'(lambda (a) (expt 2 a))
          (loop for i from 1 to n collect i)))
 
(defun paral-test-3 (n)
  (lparallel:pmapcar #'(lambda (a) (expt 2 a))
            (loop for i from 1 to n collect i)))

(progn (time (paral-test 200)) (time (paral-test-2 200)) (time (paral-test-3 200)) nil)