Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Incremental Calculation for Fully Adaptive Hagit Attiya and Idan Zach
 

Summary: 1
Incremental Calculation for Fully Adaptive
Algorithms
Hagit Attiya and Idan Zach
Department of Computer Science
The Technion, Haifa 32000, Israel
hagit@cs.technion.ac.il, idanz@cs.technion.ac.il
Abstract-- The step complexity of fully adaptive (FA)
algorithms depends only on the contention during an
operation, when counting both local computation and
accesses to shared registers. This paper contributes to the
design of efficient fully adaptive algorithms by specifying
and implementing two generic objects, Gather&f and
Collect&f.
A Gather&f object returns the value of applying a
function f on the information previously stored in the
object. In order to reduce the local step complexity, our
implementation of a Gather&f calculates f incrementally,
as values are stored in the object. This implementation uses
only read and write operations on the shared memory. It

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences