Abstract: An electronic device has primary and secondary functionalities. The electronic device includes a physical switch to switch between a first mode and a second mode. The electronic device includes logic to, when the electronic device is connected to a host computing device, expose the primary functionality to the host computing device when in the first mode, and expose the secondary functionality to the host computing device when in the second mode. The host computing device typically requires a driver particular to the electronic device when the primary functionality is exposed, and does not typically require a driver particular to the electronic device when the secondary functionality is exposed. The secondary functionality may include acting as a removable storage device storing a text file. The text file may contain information regarding the electronic device, and a user may modify the text file to cause a corresponding action to be performed.

Abstract: Read-copy-update (RCU) is performed within real-time and other types of systems, such that memory barrier usage within RCU is reduced. A computerized system includes processors, memory, updaters, and readers. The updaters update contents of a section of the memory by using first and second sets of per-processor counters, first and second sets of per-processor need-memory-barrier bits, and a global flip-counter bit. The global flip-counter bit specifies which of the first or second set of the per-processor counters and the per-processor need-memory-barrier bits is a current set, and which is a last set. The readers read the contents of the section of the memory by using the first and second sets of per-processor counters, the first and second sets of per-processor need-memory-barrier bits, and the global flip-counter bit, in a way that significantly reduces the need for memory barriers during such read operations.

Abstract: Queuing of received transactions that have a resource conflict is disclosed. A first node receives a first transaction from a second node, where the first transaction relates to a resource of the first node. The transaction may be a request relating to a memory line of the first node, for instance. It is determined that a second transaction that relates to this resource of the first node is already being processed by the first node. Therefore, the first transaction is enqueued in a conflict queue within the first node. The queuing may be a linked list, a priority queue, or another type of queue. Once the second transaction has been processed, the first transaction is restarted for processing by the first node. The first transaction is then processed by the first node.

Abstract: The acquisition of a lock among nodes of a divided cluster is disclosed. A method is performable by each of at least one node of the cluster. A node waits for a delay corresponding to its identifier. The node asserts intent to acquire the lock by writing its identifier to X and Y variables where another node has failed to acquire the lock. The node waits for another node to acquire the lock where the other node has written to X, and proceeds where Y remains equal to its own identifier. The node waits for another node to acquire the lock where the other node has written to a Z variable, and writes its own identifier to Z and proceeds where the other node has failed. The node writes a value to Y indicating that it is acquiring the lock, and maintains acquisition by periodically writing to Z.

Abstract: Mobile node registration with the home network of the mobile node is delayed when the mobile node moves to a foreign network. The mobile node has a home network in which the mobile node has a home address. In response to the mobile node moving to a foreign network (such as by being turned on in the foreign network), the mobile node receives a care-of address. Where the mobile node has no ongoing communication sessions, the mobile node waits to register its care-of address with its home agent in the home network until the mobile node initiates a communication session within the foreign network, which may not ever occur. The mobile node by registering the care-of address with the home agent informs the home agent where to forward data sent to the mobile node's home address.

Abstract: Atomic renaming and moving of data files, while permitting lock-free look-ups to the data files, is disclosed. A temporary record may be created within a hash chain encompassing a record for a data file and corresponding to a location of the data file within a computer file system. The temporary record is linked within the hash chain so that the temporary record points to the same records to which the record for the data file points. The record for the data file is renamed with a new name, and/or moved to a new location within the computer file system, and the temporary record is removed from the hash chain. Before the temporary record is removed, look-ups of the data file resolve to the temporary record, the temporary record causing the look-ups to wait until the record for the data file has been renamed and/or moved and the temporary record removed.