Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: Apparatus, methods, and program products are disclosed that provide a technology that implicitly isolates a portion of a transactional memory that is shared between multiple threads for exclusive use by an isolating thread without the possibility of other transactions modifying the isolated portion of the transactional memory. In some of the described embodiments read locations of a shared memory are covered by a first set of lock objects, and write locations are covered by a second set of lock objects, each lock object in each set having a reader mode and a writer mode. Some of these embodiments acquiring each lock object in the first set using the reader mode, and acquire each lock object in the second set using the writer mode. These embodiments store result data values at write locations in the shared memory subsequent to the acquiring said first and second set of lock objects.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: The present disclosure describes a unique way for each of multiple processes to operate in parallel and use the same shared data without causing corruption to the shared data. For example, during a commit phase, a corresponding transaction can attempt to increment a globally accessible version information variable and store a current value of the globally accessible version information variable for updating version information associated with modified data regardless of whether an associated attempt by the corresponding transaction to modify the globally accessible version information variable was successful. As an alternative mode, a corresponding transaction can merely read and store a current value of the globally accessible version information variable without attempting to update the globally accessible version information variable before such use.

Abstract: A scalable first-in-first-out queue implementation adjusts to load on a host system. The scalable FIFO queue implementation is lock-free and linearizable, and scales to large numbers of threads. The FIFO queue implementation includes a central queue and an elimination structure for eliminating enqueue-dequeue operation pairs. The elimination mechanism tracks enqueue operations and/or dequeue operations and eliminates without synchronizing on the FIFO queue implementation.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: System, methods, and computer program products are provided for enhanced freight tracking and monitoring. The system may track the location of a freight shipment within a carrier's transportation network from the time it is picked up by a carrier from a consignor until it is delivered to a consignee, provide for weight determinations and shipping re-classifications of the freight shipment during transport, and provide real-time status information and reports to the carrier, consignor, and/or consignee.

Abstract: The present disclosure describes a unique way for each of multiple processes to operate in parallel and use the same shared data without causing corruption to the shared data. For example, during a commit phase, a corresponding transaction can attempt to increment a globally accessible version information variable and store a current value of the globally accessible version information variable for updating version information associated with modified data regardless of whether an associated attempt by the corresponding transaction to modify the globally accessible version information variable was successful. As an alternative mode, a corresponding transaction can merely read and store a current value of the globally accessible version information variable without attempting to update the globally accessible version information variable before such use.

Abstract: Apparatus, methods, and program products are disclosed that provide a technology that implicitly isolates a portion of a transactional memory that is shared between multiple threads for exclusive use by an isolating thread without the possibility of other transactions modifying the isolated portion of the transactional memory.

Abstract: The design of nonblocking linked data structures using single-location synchronization primitives such as compare-and-swap (CAS) is a complex affair that often requires severe restrictions on the way pointers are used. One way to address this problem is to provide stronger synchronization operations, for example, ones that atomically modify one memory location while simultaneously verifying the contents of others. We provide a simple and highly efficient nonblocking implementation of such an operation: an atomic k-word-compare single-swap operation (KCSS). Our implementation is obstruction-free. As a result, it is highly efficient in the uncontended case and relies on contention management mechanisms in the contended cases. It allows linked data structure manipulation without the complexity and restrictions of other solutions.

Abstract: We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocking property we consider is obstruction-freedom. Obstruction-freedom is weaker than lock-freedom; as a result, it admits substantially simpler and more efficient implementations. An interesting feature of our obstruction-free STM implementation is its ability to use of modular contention managers to ensure progress in practice.

Abstract: The design of nonblocking linked data structures using single-location synchronization primitives such as compare-and-swap (CAS) is a complex affair that often requires severe restrictions on the way pointers are used. One way to address this problem is to provide stronger synchronization operations, for example, ones that atomically modify one memory location while simultaneously verifying the contents of others. We provide a simple and highly efficient nonblocking implementation of such an operation: an atomic k-word-compare single-swap operation (KCSS). Our implementation is obstruction-free. As a result, it is highly efficient in the uncontended case and relies on contention management mechanisms in the contended cases. It allows linked data structure manipulation without the complexity and restrictions of other solutions.

Abstract: The design of nonblocking linked data structures using single-location synchronization primitives such as compare-and-swap (CAS) is a complex affair that often requires severe restrictions on the way pointers are used. One way to address this problem is to provide stronger synchronization operations, for example, ones that atomically modify one memory location while simultaneously verifying the contents of others. We provide a simple and highly efficient nonblocking implementation of such an operation: an atomic k-word-compare single-swap operation (KCSS). Our implementation is obstruction-free. As a result, it is highly efficient in the uncontended case and relies on contention management mechanisms in the contended cases. It allows linked data structure manipulation without the complexity and restrictions of other solutions.

Abstract: The design of nonblocking linked data structures using single-location synchronization primitives such as compare-and-swap (CAS) is a complex affair that often requires severe restrictions on the way pointers are used. One way to address this problem is to provide stronger synchronization operations, for example, ones that atomically modify one memory location while simultaneously verifying the contents of others. We provide a simple and highly efficient nonblocking implementation of such an operation: an atomic k-word-compare single-swap operation (KCSS). Our implementation is obstruction-free. As a result, it is highly efficient in the uncontended case and relies on contention management mechanisms in the contended cases. It allows linked data structure manipulation without the complexity and restrictions of other solutions.

Abstract: The present disclosure describes a unique way for each of multiple processes to operate in parallel and use the same shared data without causing corruption to the shared data. For example, during a commit phase, a corresponding transaction can attempt to increment a globally accessible version information variable and store a current value of the globally accessible version information variable for updating version information associated with modified data regardless of whether an associated attempt by the corresponding transaction to modify the globally accessible version information variable was successful. As an alternative mode, a corresponding transaction can merely read and store a current value of the globally accessible version information variable without attempting to update the globally accessible version information variable before such use.