Apple Inc.

Puja Dilip Gupta

Timothy P Hannon

Joseph R Auricchio

Ananthakrishna Ramesh

Matthew W Wright

Wenguang Wang

Daniel Jeffrey Post

Matthew John Byom

James Michael Magee

Conrad Sauerwald

Daniel Allen Chimene

Eric Brandon Tamura

Daniel Andreas Steffen

Jeremy C Andrus

Mark Steven Day

Pierre Habouzit

Christopher Yoshito Emura

Techniques are disclosed relating to efficiently handling execution of multiple threads to perform various actions. In some embodiments, an application instantiates a queue and a synchronization primitive. The queue maintains a set of work items to be operated on by a thread pool maintained by a kernel. The synchronization primitive controls access to the queue by a plurality of threads including threads of the thread pool. In such an embodiment, a first thread of the application enqueues a work item in the queue and issues a system call to the kernel to request that the kernel dispatch a thread of the thread pool to operate on the first work item. In various embodiments, the dispatched thread is executable to acquire the synchronization primitive, dequeue the work item, and operate on it.

Multi-thread synchronization primitive

Systems and methods are disclosed for implementing an educational mode on a portable computing device, such as a tablet computer, that is a single-user system, used serially by multiple users. Each user can have a separate user storage that may be encrypted. The computing device boots as a system user to a login screen. A first student user enters user credentials into the login screen. The computing device can reboot the user-space processes, while leaving the kernel running, rebooting the computing device as the first student user. When the first student user logs out, data to be synchronized to, e.g., the cloud, can be synchronized for the first student user while a second student user is logged into the device.

Switching users and sync bubble for EDU mode

Systems and methods are disclosed for secure relocation of encrypted files for a system having non-volatile memory ('NVM'). A system can include an encryption module that is configured to use a temporary encryption seed (e.g., a randomly generated key and a corresponding initialization vector) to decrypt and encrypt data files in an NVM. These data files may have originally been encrypted with different encryption seeds. Using such an approach, data files can be securely relocated even if the system does not have access to the original encryption seeds. In addition, the temporary encryption seed allows the system to bypass a default key scheme.

Secure relocation of encrypted files

Systems, methods, computer program products, and means are provided for verifying the integrity of data structures. A system includes a first data structure, a second data structure, and a fingerprint block. The first data structure has a first set of unique identifiers. The second data structure has a second set of unique identifiers. The fingerprint block verifies correspondence between the first and second data structures by performing a mathematical function on the first and second sets of unique identifiers to produce a result indicative of correspondence.

Verifying integrity of file system data structures

Growing community of inventors

Sunnyvale, CA, United States of America

Puja Dilip Gupta