diff --git a/src/schedule/zephyr_ll.c b/src/schedule/zephyr_ll.c
index a91a6c24f5e4..c03589551356 100644
--- a/src/schedule/zephyr_ll.c
+++ b/src/schedule/zephyr_ll.c
@@ -96,9 +96,11 @@ static void zephyr_ll_task_insert_unlocked(struct zephyr_ll *sch, struct task *t
 	task->state = SOF_TASK_STATE_QUEUED;
 
 	/*
-	 * Tasks are added into the list from highest to lowest priority. This
-	 * way they can then be run in the same order. Tasks with the same
-	 * priority are served on a first-come-first-serve basis
+	 * Tasks are added into the list with largest priority value
+	 * first, followed by smaller values. The list is used to run
+	 * the tasks in priority order, with priority 0 being the
+	 * highest and always run first. Tasks with the same
+	 * priority are served on a first-come-first-serve basis.
 	 */
 	list_for_item(list, &sch->tasks) {
 		task_iter = container_of(list, struct task, list);