Sciweavers

4759 search results - page 337 / 952
» Parallelizing the Phylogeny Problem
Sort
View
PODC
2003
ACM
15 years 12 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
ANSS
2002
IEEE
15 years 11 months ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza
ICDCS
2002
IEEE
15 years 11 months ago
D-Stampede: Distributed Programming System for Ubiquitous Computing
We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environme...
Sameer Adhikari, Arnab Paul, Umakishore Ramachandr...
ASAP
2000
IEEE
184views Hardware» more  ASAP 2000»
15 years 11 months ago
Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the l...
Marcus Bednara, Oliver Beyer, Jürgen Teich, R...
CLUSTER
2000
IEEE
15 years 11 months ago
Distributed Processor Allocation in Multicomputers
Current processor allocation techniques for multicomputers are based on centralized front-end based algorithms. As a result, the applied strategies are usually restricted to stati...
Rose Rose, Hans-Ulrich Heiss, Philippe Olivier Ale...