Sciweavers

794 search results - page 157 / 159
» Stackelberg scheduling strategies
Sort
View
JCSS
2008
81views more  JCSS 2008»
13 years 11 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
JOT
2008
105views more  JOT 2008»
13 years 11 months ago
Using Multiple Servers in Concurrent Garbage Collector
Object-oriented programming languages are being widely adopted as one of the most powerful languages due their flexibility and reusability. However, these languages suffer from me...
Ali Ebrahim El Desokey, Amany Sarhan, Seham Moawed
JSAC
2006
174views more  JSAC 2006»
13 years 10 months ago
Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations
Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheles...
Yajian Liu, Reza Hoshyar, X. Yang, Rahim Tafazolli
JFP
2000
91views more  JFP 2000»
13 years 10 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
PC
2010
196views Management» more  PC 2010»
13 years 9 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak