Add to ORKGAbstract. Time-sharing operating systems may delay application processing of incoming messages because other processes are scheduled when the mes-sages arrive. In this paper, we present a simple adjustment to application polling behavior that reduces this effect when the parallel process competes with CPU-intensive sequential jobs. Our results showed that moderate im-provement might be achieved. However, the effectiveness of the approach is highly application-dependent. 1
The low cost and availability of clusters of workstations have lead researchers to re-explore distri...
International audienceMulti-core systems are increasingly interesting candidates for executing paral...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...
. In this paper, we describe experiments comparing the communication times for a number of different...
Time-sensitive applications that are also CPU intensive like video games, video playback, eye-candy ...
Time sensitive applications like media players/editors and games are increasingly being deployed on ...
Parallel application support is one of the ways that have been recently proposed for exploiting the ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1996.Designing high performance...
Today, high-quality media streaming and rich-media ap-plications have become available on desktop co...
Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applic...
Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applic...
In this thesis, we studied the behavior of parallel programs to understand how to automated the task...
<p>Applications running concurrently on a multicore system interfere with each other at the main mem...
This paper examines the plausibility of using a network of workstations (NOW) for a mixture of paral...
Gang Scheduling improves the performance of parallel programs by running all child processes concurr...
The low cost and availability of clusters of workstations have lead researchers to re-explore distri...
International audienceMulti-core systems are increasingly interesting candidates for executing paral...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...
. In this paper, we describe experiments comparing the communication times for a number of different...
Time-sensitive applications that are also CPU intensive like video games, video playback, eye-candy ...
Time sensitive applications like media players/editors and games are increasingly being deployed on ...
Parallel application support is one of the ways that have been recently proposed for exploiting the ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1996.Designing high performance...
Today, high-quality media streaming and rich-media ap-plications have become available on desktop co...
Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applic...
Most parallel machines, such as clusters, are space-shared in order to isolate batch parallel applic...
In this thesis, we studied the behavior of parallel programs to understand how to automated the task...
<p>Applications running concurrently on a multicore system interfere with each other at the main mem...
This paper examines the plausibility of using a network of workstations (NOW) for a mixture of paral...
Gang Scheduling improves the performance of parallel programs by running all child processes concurr...
The low cost and availability of clusters of workstations have lead researchers to re-explore distri...
International audienceMulti-core systems are increasingly interesting candidates for executing paral...
International audienceParallel runtime systems such as MPI or task-based libraries provide models to...