Sökning: "Amortized Complexity"
Hittade 4 avhandlingar innehållade orden Amortized Complexity.
1. Lock-free Concurrent Search
Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER
2. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures
Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER
3. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections
Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER
4. On Design and Applications of Practical Concurrent Data Structures
Sammanfattning : The proliferation of multicore processors is having an enormous impact on software design and development. In order to exploit parallelism available in multicores, there is a need to design and implement abstractions that programmers can use for general purpose applications development. LÄS MER