OPODIS
2008
13 years 6 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
WDAG
2000
Springer
13 years 8 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
LCPC
2000
Springer
13 years 8 months ago
2000
Springer
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
HPCC
2007
Springer
13 years 8 months ago
2007
Springer
This paper proposes a highly efficient MBRP parallel algorithm for H.264 encoder, which is based on the analysis of data dependencies in H.264 encoder. In the algorithm, the video ...
SPAA
1992
ACM
13 years 9 months ago
1992
ACM
A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in...
ISCA
1994
IEEE
13 years 9 months ago
1994
IEEE
In the near future, semiconductor technology will allow the integration of multiple processors on a chip or multichipmodule (MCM). In this paper we investigate the architecture an...
ICDCS
1996
IEEE
13 years 9 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract. Parallel processing is based on utilizing a group of processors to efficiently solve large problems faster than is possible on a single processor. To accomplish this, the...
HIPC
2003
Springer
13 years 10 months ago
2003
Springer
This paper shows that an n = 2k processor Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can simulate either a mono-directional move of a...