Abstract: A pre-applied, remoistenable adhesive useful in bonding wood substrates together.

Abstract: An arrangement is provided for detecting deadlocks in a multithreaded program. When a thread in a multithreaded program performs a resource operation related to a mutually exclusive shared resource, it creates relationships between the thread and the shared resource as well as between the thread and other threads of the multithreaded program. Such created relationships are monitored and used to detect deadlocks.

Abstract: A method and apparatus for implementing a parallel construct comprised of a single task is described. A method comprises receiving a first code segment, the first code segment having a set of instances of a parallel construct, each of the set of instances of the parallel construct comprised of a task, and translating the first code segment to a second code segment, the second code segment, when being executed to perform operations comprising: allocating a shared value, the shared value to indicate a most current one of the set of instances encountered by one of a team of threads, allocating a private value for each of the team of threads, the private value to indicate one of the set of instances encountered by the private value's corresponding thread of the team of threads, maintaining the shared value with the team of threads, and maintaining the private value of each of the team of threads with the private value's corresponding thread of the team of threads.

Abstract: A system for updating a merchant customer account database is provided, wherein the system may be used to update a merchant's customer database in response to changes made to a customer transaction account. The system provides a remote database location which stores a merchant's customer transaction account information for customers using the transaction account for recurring billing purposes. A server is used to manage the remote database information to update the remote database in response to changes in transaction account information. The updated transaction account information is then periodically provided to the merchant for use in updating the merchant's customer account database.

Abstract: A system for updating a merchant customer account database is provided, wherein the system may be used to update a merchant's customer database in response to changes made to a customer transaction account. The system provides a remote database location which stores a merchant's customer transaction account information for customers using the transaction account for recurring billing purposes. A server is used to manage the remote database information to update the remote database in response to changes in transaction account information. The updated transaction account information is then periodically provided to the merchant for use in updating the merchant's customer account database.

Abstract: A system for updating a merchant customer account database is provided, wherein the system may be used to update a merchant's customer database in response to changes made to a customer transaction account. The system provides a remote database location which stores a merchant's customer transaction account information for customers using the transaction account for recurring billing purposes. A server is used to manage the remote database information to update the remote database in response to changes in transaction account information. The updated transaction account information is then periodically provided to the merchant for use in updating the merchant's customer account database.

Abstract: A method and apparatus for a atomic operation is described. A method comprises receiving a first program unit in a parallel computing environment, the first program unit including a memory update operation to be performed atomically, the memory update operation having an operand, the operand being of a data-type and of a data size, and translating the first program unit into a second program unit, the second program unit to associate the memory update operation with a set of one or more low-level instructions upon determining that the data size of the operand is supported by the set of low-level instructions, the set of low-level instructions to ensure atomicity of the memory update operation.

Abstract: An arrangement is provided for detecting deadlocks in a multithreaded program. When a thread in a multithreaded program performs a resource operation related to a mutually exclusive shared resource, it creates relationships between the thread and the shared resource as well as between the thread and other threads of the multithreaded program. Such created relationships are monitored and used to detect deadlocks.

Abstract: A pre-applied, remoistenable adhesive useful in bonding wood substrates together.

Abstract: In some embodiments of the present invention, a parallel computer system provides a plurality of threads that execute code structures. A method and apparatus may be provided to copy data from one thread to another thread.

Abstract: A software implemented mechanism detects defects in multithreaded programs. Defects are classified into two categories, races and deadlocks. The races are instanced during the execution of the program where multiple threads may modify and access a shared variable without being synchronized. The synchronization might be due to direct or inferred mutual exclusion due to transitive synchronization derived from a signaling event, or derived from prior direct mutual exclusion. Deadlocks are detected by server tasks which monitor a representation of thread state and detect cycles in these graphs. A degenerate form of deadlock is detected where a thread can not make forward progress for a defined period of time due to the unavailability of a resource or the lack of a signaling event. The mechanism includes an annotated address trace generator, an analysis mechanism for detecting defects in the annotated trace, a report generator for communicating the defects to the user.

Abstract: A method and apparatus for a reduction operation is described. A method may be utilized that includes receiving a first program unit in a parallel computing environment, the first program unit may include a reduction operation to be performed and translating the first program unit into a second program unit, the second program unit may associate the reduction operation with a set of one or more low-level instructions that may, in part, perform the reduction operation.

Abstract: In some embodiments of the present invention, a parallel computer system provides a plurality of threads that execute code structures. A method may be provided to allocate available work between the plurality of threads to reduce idle thread time and increase overall computational efficiency. An otherwise idle thread may enter a work stealing mode and may locate and execute code from other threads.

Abstract: A method and apparatus for a atomic operation is described. A method comprises receiving a first program unit in a parallel computing environment, the first program unit including a memory update operation to be performed atomically, the memory update operation having an operand, the operand being of a data-type and of a data size, and translating the first program unit into a second program unit, the second program unit to associate the memory update operation with a set of one or more low-level instructions upon determining that the data size of the operand is supported by the set of low-level instructions, the set of low-level instructions to ensure atomicity of the memory update operation.

Abstract: In an embodiment, a method includes receiving a first source code having a number of global storage objects, wherein the number of global storage objects are to be accessed by a number of threads during execution. The method also includes translating the first source code into a second source code. The translating includes adding initialization logic for each of the number of global storage objects. The initialization logic includes generating private copies of each of the number of global storage objects during execution of the second source code. The initialization logic also includes generating at least one cache object during the execution of the second source code, wherein the private copies of each of the number of global storage objects are accessed through the at least one cache object during execution of the second source code.

Abstract: A method and apparatus for implementing a parallel construct comprised of a single task is described. A method comprises receiving a first code segment, the first code segment having a set of instances of a parallel construct, each of the set of instances of the parallel construct comprised of a task, and translating the first code segment to a second code segment, the second code segment, when being executed to perform operations comprising: allocating a shared value, the shared value to indicate a most current one of the set of instances encountered by one of a team of threads, allocating a private value for each of the team of threads, the private value to indicate one of the set of instances encountered by the private value's corresponding thread of the team of threads, maintaining the shared value with the team of threads, and maintaining the private value of each of the team of threads with the private value's corresponding thread of the team of threads.

Abstract: A system for updating a merchant customer account database is provided, wherein the system may be used to update a merchant's customer database in response to changes made to a customer transaction account. The system provides a remote database location which stores a merchant's customer transaction account information for customers using the transaction account for recurring billing purposes. A server is used to manage the remote database information to update the remote database in response to changes in transaction account information. The updated transaction account information is then periodically provided to the merchant for use in updating the merchant's customer account database.

Abstract: This invention relates to water-soluble/dispersible reactive functionalized imido and polyimido compounds, wherein the polyimido compounds may be selected from the group consisting of polysuccinimide compounds, polyglutimide compounds, and copolymers of thereof. The polyimido compound comprises a functionalizing moiety F that provides functionality to the polyimido compound and is preferably derived from a nucleophilic moiety selected from the group consisting of amines, alcohols, phenols, thiols, and carboxylates; and a water-solubilizing/dispersing moiety that provides water-solubility and/or water-dispersibility to the polyimido compound and is preferably derived from a nucleophilic moiety selected from the group consisting of amines, alcohols, phenols, thiols, and carboxylates. The invention also pertains to a proteinaceous substrate to which the imido or polyimido compound has been covalently bonded and to a method for treating a proteinaceous substrate with the imido or polyimido compound.

Abstract: This invention relates to water-soluble/dispersible reactive imido and polyimido compounds, wherein the polyimido compounds may be selected from the group consisting of polysuccinimide compounds, polyglutimide compounds, and copolymers of thereof. The polyimido compounds comprise a water-solubilizing/dispersing moiety that provides water-solubility and/or water-dispersibility to the polyimido compound and preferably is derived from a nucleophilic moiety selected from the group consisting of amines, alcohols, phenols, thiols, and carboxylates. The present invention also pertains to a proteinaceous substrate to which the imido or polyimido compound has been covalently bonded and to a method for treating a proteinaceous substrate with the imido or polyimido compound.

Abstract: A software-implemented method for validating the correctness of parallel computer programs, written in various programming languages, with respect to these programs' corresponding sequential computer programs. Validation detects errors that could cause parallel computer programs to behave incorrectly or to produce incorrect results, and is accomplished by transforming these parallel computer programs under the control of a general purpose computer and sequentially executing the resulting transformed programs. The validation method is system-independent and is portable across various computer architectures and platforms since validation is accomplished via program transformation; thus, the method does not depend on the features of a particular hardware architecture or configuration, operating system, compiler, linker, or thread environment. The input to the validation method is a parallel computer program.