392 search results - page 42 / 79 » Modular Competitiveness for Distributed Algorithms |
HPCN
1995
Springer
14 years 12 hour ago
1995
Springer
Performance evaluation studies are to be an integral part of the design and tuning of parallel applications. We propose a hierarchical approach to the systematic characterization o...
MOBIDE
2010
ACM
13 years 8 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
CONTEXT
2001
Springer
14 years 29 days ago
2001
Springer
A recent report by the National Research Council (NRC) declares neural networks “hold the most promise for providing powerful learning models”. While some researchers have expe...