Abstract: A method for executing an application over a plurality of nodes in each of which an application monitor and a runtime are executing includes executing a first portion of the application by first threads of the runtime of the first node and a second portion of the application by second threads of the runtime of the second node, and under control of the application monitors of the first and second nodes and while executing the first portions and second portions of the application, migrating workloads of one or more of the first threads from the first node to the second node for execution by the second threads.

Abstract: Thread local storage is allocated to a thread that is executed in different link domains that share a memory address space by initially allocating a thread local storage having a first base address in the shared memory address space to the thread and a thread local storage having a second base address in the shared memory address space to a second thread that is created as a watcher thread of the first thread. When it is determined that the first thread has made a transition from executing code from the first link domain to executing code from the second link domain, the thread local storage having the second base address is allocated to the first thread. Thereafter, when it is determined that the first thread has resumed executing code from the first link domain, the thread local storage having the first base address is allocated to the first thread.

Abstract: A coherence protocol applied to memory pages maintains coherence between memory spaces on a plurality of nodes so that the threads of the runtime are operable on any of the nodes. The nodes operating according to the coherence protocol track a state and an epoch number for each memory page residing therein. The states include a modified state in which only one particular node has an up-to-date copy of the memory page, an exclusive state in which only one particular node owns the memory page, a shared state in which all nodes that have the memory page in the shared state have the same copy, and a lost state in which the memory page cannot be either read or written. The epoch number is a number that is incremented each time the page enters the modified state and is used to determine whether the page contains data that is stale.