Sciweavers

1929 search results - page 153 / 386
» Load Balancing with Memory
Sort
View
108
Voted
COMSIS
2010
14 years 10 months ago
A content-based dynamic load-balancing algorithm for heterogeneous web server cluster
According to the different requests of Web and the heterogeneity of Web server, the paper presents a content-based loadbalancing algorithm. The mechanism of this algorithm is that ...
Lin Zhang, Xiao Ping Li, Su Yuan
111
Voted
CORR
2012
Springer
173views Education» more  CORR 2012»
13 years 8 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge
SIAMSC
2008
129views more  SIAMSC 2008»
15 years 22 days ago
Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
Hari Sundar, Rahul S. Sampath, George Biros
ISCA
2006
IEEE
169views Hardware» more  ISCA 2006»
15 years 6 months ago
Balanced Cache: Reducing Conflict Misses of Direct-Mapped Caches
Level one cache normally resides on a processor’s critical path, which determines the clock frequency. Directmapped caches exhibit fast access time but poor hit rates compared w...
Chuanjun Zhang
78
Voted
IPPS
1998
IEEE
15 years 5 months ago
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
Vincenzo Auletta, Sajal K. Das, Amelia De Vivo, Ma...