Sciweavers

700 search results - page 91 / 140
» A Proposal for Task Parallelism in OpenMP
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
112
Voted
HPDC
2005
IEEE
15 years 9 months ago
Interest-aware information dissemination in small-world communities
Information dissemination is a fundamental and frequently occuring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware info...
Adriana Iamnitchi, Ian T. Foster
PDP
2005
IEEE
15 years 9 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
DATE
2010
IEEE
163views Hardware» more  DATE 2010»
15 years 8 months ago
Efficient High-Level modeling in the networking domain
-- Starting Electronic System Level (ESL) design flows with executable High-Level Models (HLMs) has the potential to sustainably improve productivity. However, writing good HLMs fo...
Christian Zebelein, Joachim Falk, Christian Haubel...
134
Voted
FTDCS
1995
IEEE
15 years 7 months ago
A Network Channel Buffer Scheduling Algorithm for an Interactive VOD Server
A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR)...
Sungyoung Lee, Hyungill Kim, Jongwon Lee