Now showing items 1-6 of 6
Adaptive Cache-Oblivious All-to-All Operation
Modern processors rely on cache memories to reduce the latency of data accesses. Extensive cache misses would thus compromise the usefulness of the scheme. Cache-aware algorithms make use of the knowledge about the cache, ...
Relaxing Routing Table to Alleviate Dynamism in P2P Systems
In dynamic P2P networks, nodes join and depart from the system frequently, which partially damages the predefined P2P structure, and impairs the system performance such as basic lookup functionality. Therefore stabilization ...
Hierarchical Multi-Bottleneck Classification Method And Its Application to DNA Microarray Expression Data
The recent development of DNA microarray technology is creating a wealth of gene expression data. Typically these datasets have high dimensionality and a lot of varieties. Analysis of DNA microarray expression data is a ...
Provably Efficient Adaptive Scheduling for Parallel Jobs
Scheduling competing jobs on multiprocessors has always been an important issue for parallel and distributed systems. The challenge is to ensure global, system-wide efficiency while offering a level of fairness to user ...
Efficient Algorithms for Load Shuffling in Split-Platform AS/RS
We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. ...
Mapping Unstructured Parallelism to Series-Parallel DAGs
Many parallel programming languages allow programmers to describe parallelism by using constructs such as fork/join. When executed, such programs can be modeled as directed graphs, with nodes representing a computation and ...