Groote, J.F., Hesselink, W.H.: Synchronization-free parallel accessible hash-table. In preparation (1999)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....performance and dependability on multiprocessors with unpredictable load patterns. Here a common challenge is to eciently perform t independent tasks on n processors [16] Such tasks could be copying a large array, searching a collection of data, or applying a function to all elements of a matrix [13, 14]. In such cases a Write All algorithm can be used with the only change being that the assignment to a particular array element is replaced by a distinct task. The Write All problem has been substantially studied for synchronous failure prone processors, but there is a dearth of deterministic ....

Groote, J.F., Hesselink, W.H.: Synchronization-free parallel accessible hash-table. In preparation (1999)

....performance and dependability on multiprocessors with unpredictable load patterns. Here a common challenge is to eciently perform t independent tasks on n processors [17] Such tasks could be copying a large array, searching a collection of data, or applying a function to all elements of a matrix [14, 15]. In such cases a Write All algorithm can be used with the only change being that the assignment to a particular array element is replaced by a distinct task. Write All algorithms can be used iteratively to simulate parallel algorithms formulated for synchronous failure free processors. This ....

Groote, J.F., Hesselink, W.H.: Synchronization-free parallel accessible hash-table. In preparation (1999)

....from synchrony or by the failures of some processors to complete tasks on time. Here again, a common challenge is to perform N independent tasks on P processors [14] Such tasks could be copying a large array, searching a collection of data, or applying a function to all elements of a matrix [12, 13]. Other examples include checking all the points in a large solution space, trying to generate a witness or to refute its existence, or simply performing a number of similar independent calculations. In this paper we focus on the work complexity of the Do All problem in the presence of arbitrary ....

Groote, J.F., Hesselink, W.H., \Synchronization-free Parallel Accessible Hash-Table", in preparation, 1999.

....) T where W (P ) is the work complexity of any algorithm solving the Write All problem of size P . In [9] an overview is given of the algorithms and PRAM simulations that have been developed so far. Our motivation is quite di erent. It comes from the design of wait free or asynchronous algorithms [4 6], to obtain fast, reliable programs for general purpose parallel computers with typically a few dozen processes that run under widely varying loads. A common problem on such machines is to carry out a task, consisting of N independent subtasks, with P processes, as quickly as possible. Such ....

....as quickly as possible. Such tasks are, for instance, copying an array, searching an unordered table, and applying a function to all elements of a matrix. We encountered this problem when we had to nd a parallel solution to refresh a hashtable by copying all valid elements to a new array [4]. If we abstract from the nature of the subtasks, the problem of executing N independent tasks is adequately characterized by the Write All problem. In this paper we present a rather straightforward algorithm to solve the Write All problem on an asynchronous PRAM, i.e. a machine on which the ....

J.F. Groote and W.H. Hesselink. Synchronization-free parallel accessible hash-tables. In preparation, 2000.

No context found.

Groote, J.F., Hesselink, W.H.: Synchronization-free parallel accessible hash-table. In preparation (1999)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC