Abstract: A processing system includes a task queue to serve as a circular buffer. Each record in the queue may include a status field and a task field. A producer thread in the processing system may determine whether the queue is full, based on the status field in the record at the tail of the queue. The producer may add a task to the queue in response to determining that the status field in the record at the tail of the queue marks that record as empty. A consumer thread may determine whether the queue is empty, based on the status field in the record at the head of the queue. The consumer may execute a pending task identified by the record at the head of the queue, in response to determining that the status field in the head record marks that record as full. Other embodiments are described and claimed.

Abstract: A database includes a vertex array that contains coordinates of a three-dimensional mesh, a face array that contains pointers to target coordinates in the vertex array, the target coordinates defining a polygon in the three-dimensional mesh, a free vertex container that identifies elements in the vertex array that do not contain vertices, and a free face container that identifies elements in the face array that do not contain pointers.

Abstract: A database includes a vertex array that contains coordinates of a three-dimensional mesh, a face array that contains pointers to target coordinates in the vertex array, the target coordinates defining a polygon in the three-dimensional mesh, a free vertex container that identifies elements in the vertex array that do not contain vertices, and a free face container that identifies elements in the face array that do not contain pointers.