Sciweavers

IMSCCS
2006
IEEE
14 years 5 months ago
Implementations of Grid-Based Distributed Parallel Computing
Grid computing provides new solutions for numerous complex problems. It is an inevitable trend to implement the distributed parallel computing of large-scale problems with the gri...
Weiwei Lin, Changgeng Guo, Deyu Qi, Yuehong Chen, ...
PACT
2007
Springer
14 years 5 months ago
Parallelism Granules Aggregation with the T-System
T-system is a tool for parallel computing developed at the PSI RAS. The most recent implementation is available on both Linux and Windows platforms. The paper is dedicated to one o...
Alexander Moskovsky, Vladimir Roganov, Sergey Abra...
PDCAT
2009
Springer
14 years 6 months ago
Supporting Partial Ordering with the Parallel Iterator
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
Nasser Giacaman, Oliver Sinnen
IWANN
2009
Springer
14 years 6 months ago
General Purpose Agent-Based Parallel Computing
Parallel computing has become an important research field in the last years. The availability of hardware and the success of grid computing have motivated this interest. In this pa...
David Sánchez, David Isern, Ángel Ro...
COORDINATION
2009
Springer
14 years 6 months ago
Fairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
Alexis Petrounias, Susan Eisenbach
SPAA
2009
ACM
14 years 6 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
SPAA
2009
ACM
14 years 6 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
SPAA
2009
ACM
14 years 6 months ago
Scheduling to minimize staleness and stretch in real-time data warehouses
MohammadHossein Bateni, Lukasz Golab, Mohammad Tag...
SPAA
2009
ACM
14 years 6 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski