Search Results for "can"

Takes care of all needed repetitive low-level initialization and allows you to quickly create the following types of sockets: * TCP server * TCP client * UDP unicast producer * UDP unicast consumer * UDP multicast producer * UDP multicast consumer * CAN socket (Linux only) CLI programs: * broadcast-hear - tests for incoming unicast/multicast traffic; * broadcast-roar - continuously sends user-specified unicast/multicast messages; * recast - converts unicast to multicast (and vice-versa) packets; * cancom - communicate over CAN bus (generate/send/receive messages, ping other nodes).

...Instead of traditional lock-based programming, one programs with atomic memory transactions: if a memory transaction returns normally it gets committed, if instead it signals an error (Lisp slang for throwing an exception) it is rolled back. Memory transactions can safely run in parallel in different threads, are re-executed from the beginning in case of conflicts or if consistent reads cannot be guaranteed, and effects of a transaction are not visible from other threads until it commits. STMX gives freedom from deadlocks, automatic rollback on failure, and it aims at resolving the tension between granularity and concurrency.

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.