Sciweavers

15494 search results - page 428 / 3099
» Computing dynamic clusters
Sort
View
EUROPAR
2005
Springer
16 years 12 days ago
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
Erik G. Boman, Doruk Bozdag, Ümit V. Ç...
PARA
2004
Springer
16 years 6 days ago
HPC-ICTM: The Interval Categorizer Tessellation-Based Model for High Performance Computing
Abstract. This paper presents the Interval Categorizer Tessellationbased Model (ICTM) for the simultaneous categorization of geographic regions considering several characteristics ...
Marilton S. de Aguiar, Graçaliz Pereira Dim...
WACV
2002
IEEE
15 years 11 months ago
Activity maps for location-aware computing
Location-based context is important for many applications. Previous systems offered only coarse room-level features or used manually specified room regions to determine fine-sca...
David Demirdjian, Konrad Tollmar, Kimberle Koile, ...
166
Voted
CIDR
2003
145views Algorithms» more  CIDR 2003»
15 years 8 months ago
Distributed Computing with BEA WebLogic Server
This paper surveys distributed computing techniques used in the implementation of BEA WebLogic Server. It discusses how application servers provide a distributed transactional inf...
Dean Jacobs
150
Voted
SOSP
1997
ACM
15 years 8 months ago
Automated Hoarding for Mobile Computers
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
Geoffrey H. Kuenning, Gerald J. Popek