Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
OPODIS
2008
11 years 11 months ago
Group Renaming
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...
Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merri...
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
12 years 1 months ago
Distributed Cooperation During the Absence of Communication
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...
Grzegorz Malewicz, Alexander Russell, Alexander A....
LCPC
2000
Springer
12 years 1 months ago
Improving Offset Assignment for Embedded Processors
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...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
IPPS
1998
IEEE
12 years 1 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
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...
Lars Lundberg, Håkan Lennerstad
HPCC
2007
Springer
12 years 1 months ago
A Highly Efficient Parallel Algorithm for H.264 Encoder Based on Macro-Block Region Partition
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 ...
Shuwei Sun, Dong Wang, Shuming Chen
SPAA
1992
ACM
12 years 2 months ago
Subset Barrier Synchronization on a Private-Memory Parallel System
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...
Anja Feldmann, Thomas R. Gross, David R. O'Hallaro...
ISCA
1994
IEEE
104views Hardware» more  ISCA 1994»
12 years 2 months ago
Exploring the Design Space for a Shared-Cache Multiprocessor
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...
Basem A. Nayfeh, Kunle Olukotun
ICDCS
1996
IEEE
12 years 2 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
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, ...
Babak Hamidzadeh, David J. Lilja
IPPS
2000
IEEE
12 years 2 months ago
ClusterNet: An Object-Oriented Cluster Network
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...
Raymond Hoare
HIPC
2003
Springer
12 years 3 months ago
Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks
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...
Alessandro Mei, Romeo Rizzi
books