Sciweavers

20197 search results - page 3690 / 4040
» Comparing Computational Power
Sort
View
ICS
2009
Tsinghua U.
15 years 11 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
DATE
2009
IEEE
159views Hardware» more  DATE 2009»
15 years 10 months ago
Design and implementation of a database filter for BLAST acceleration
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
Panagiotis Afratis, Constantinos Galanakis, Euripi...
FOCS
2009
IEEE
15 years 10 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
HPDC
2009
IEEE
15 years 10 months ago
TakTuk, adaptive deployment of remote executions
This article deals with TakTuk, a middleware that deploys efficiently parallel remote executions on large scale grids (thousands of nodes). This tool is mostly intended for intera...
Benoit Claudel, Guillaume Huard, Olivier Richard
ICIW
2009
IEEE
15 years 10 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...
« Prev « First page 3690 / 4040 Last » Next »