diff --git a/crates/sel4-async/time/src/timer_queue.rs b/crates/sel4-async/time/src/timer_queue.rs
index aa6478aac..0779260d0 100644
--- a/crates/sel4-async/time/src/timer_queue.rs
+++ b/crates/sel4-async/time/src/timer_queue.rs
@@ -3,6 +3,11 @@ use core::ops::Bound;
 
 use crate::SubKey;
 
+// We opt for a simple B-tree-based implementation rather than implementing a timer wheel. This is
+// good enough for now. Note that this approach is also good enough for `async-std`. If we ever do
+// actually need the scalability of something like a timer wheel, `tokio`'s implementation would be
+// a good place to start.
+
 pub struct TimerQueue<T, U, V> {
     pending: BTreeMap<Key<T, U>, V>,
 }