657 search results - page 94 / 132 » Implementing Matching in ALE--First Results |
PPOPP
1999
ACM
13 years 12 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
SIGIR
1999
ACM
13 years 12 months ago
1999
ACM
A content-based retrieval model for tackling the mismatch problems specific to music data is proposed and implemented. The system uses a pitch profile encoding for queries in any ...
ISPAN
1999
IEEE
13 years 12 months ago
1999
IEEE
To minimize the execution time of an iterative application in a heterogeneous parallel computing environment, an appropriate mapping scheme is needed for matching and scheduling th...
COOPIS
1998
IEEE
13 years 12 months ago
1998
IEEE
Parallel and distributed programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to manage the coexistence an...
HPDC
1998
IEEE
13 years 12 months ago
1998
IEEE
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...