Abstract: An interlocking disc includes a hub with an inner circular area with an inner thickness and a circular step. A plurality of petals circumferentially spaced apart extend radially outward from the outer area of the hub. Each of the plurality of petals are disposed within a common plane and include a catch on each of side of each petal. The catch is engageable to a circular stop of another interlocking disc to inhibit disassembly.

Abstract: An interlocking disc includes a hub with an inner circular area with an inner thickness and a circular step. A plurality of petals circumferentially spaced apart extend radially outward from the outer area of the hub. Each of the plurality of petals are disposed within a common plane and include a catch on each of side of each petal. The catch is engageable to a circular stop of another interlocking disc to inhibit disassembly.

Abstract: An interlocking disc includes a hub with an inner circular area with an inner thickness and a circular step. A plurality of petals circumferentially spaced apart extend radially outward from the outer area of the hub. Each of the plurality of petals are disposed within a common plane and include a catch on each of side of each petal. The catch is engageable to a circular stop of another interlocking disc to inhibit disassembly.

Abstract: A method and system for dynamically allocating memory, the method comprising maintaining a record of allocated memory that should be considered free in a child process, and designating as free any copy of memory identified by the record and created in a forking process.

Abstract: A process replication method for use in a multi-threaded computing environment, for improving application performance, reducing the number of deadlocks and fork safing code. The method comprises acquiring and locking available mutexes from a plurality of mutexes, determining whether any unavailable mutexes from the plurality of mutexes are held by a thread that is waiting for a mutex owned by a forking thread and, if so, ceding any such mutex to the respective waiting thread and boosting priority of the waiting thread, and registering the forking thread as first waiter for any unavailable mutexes. All of the plurality of mutexes are thereby eventually acquired and locked.

Abstract: A method and system for dynamically allocating memory, the method comprising maintaining a record of allocated memory that should be considered free in a child process, and designating as free any copy of memory identified by the record and created in a forking process.

Abstract: A process replication method for use in a multi-threaded computing environment, for improving application performance, reducing the number of deadlocks and fork safing code. The method comprises acquiring and locking available mutexes from a plurality of mutexes, determining whether any unavailable mutexes from the plurality of mutexes are held by a thread that is waiting for a mutex owned by a forking thread and, if so, ceding any such mutex to the respective waiting thread and boosting priority of the waiting thread, and registering the forking thread as first waiter for any unavailable mutexes. All of the plurality of mutexes are thereby eventually acquired and locked.