2392 search results - page 378 / 479 » Matching data dissemination algorithms to application requir... |
213
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
192
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
190
click to vote
ISPASS
2006
IEEE
16 years 12 days ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
136
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
— Network measurement at 10+Gbps speeds imposes many restrictions on the resource consumption of the measurement application, making any filtering of input data highly desirable...
163
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...