Changes between Version 2 and Version 3 of FAQ/AlgorithmicComplexity

Timestamp:

02/02/06 03:10:11 (18 years ago)

Author:

JoelSherrill

Comment:

/* POSIX API */ Add intro and update on POSIX timers fixes.

FAQ/AlgorithmicComplexity

@@ -43 +43 @@
 Although freeing memory is O(constant), freeing a large block of memory may result in the outstanding requests of multiple blocked tasks being satisfied.
 = POSIX API =
+
+The POSIX API inherits the following non-constant time algorithms from the SuperCode
+
+ *  Variable length message support
+ *  Priority based message insertion
+ *  Timer insertion (timer manager, delays, and timeouts)
 = Message Queue Manager =
 = mq_open =
@@ -61 +67 @@
 
 '''FIX:''' This is a bad implementation which was originally submitted by a user who did not understand the standard  pattern of object management.  This pattern requires objects be preallocated at system initialization time and object creation only removes one from an inactive object list.  Normally, RTEMS object Id to pointer translation is constant order so, this manager is fixable.
+
+'''UPDATE:''' As of 1 Feb 2006, JoelSherrill is testing a new implementation of POSIX timers which will not have O(n) object Id management.