1407 search results - page 238 / 282 » Using Use Cases in Executable Z |
126
click to vote
RTSS
1999
IEEE
15 years 6 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
113
click to vote
HPDC
1998
IEEE
15 years 6 months ago
1998
IEEE
One of the most difficult problems to be solved by metacomputing systems is to ensure strong authentication and authorization. The problem is complicated since the hosts involved ...
127
click to vote
ICDCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. The LBF metric differs from traditi...
138
click to vote
LCPC
1998
Springer
1998
Springer
A Loop Transformation Algorithm Based on Explicit Data Layout Representation for Optimizing Locality
15 years 6 months ago
We present a cache locality optimization technique that can optimize a loop nest even if the arrays referenced have different layouts in memory. Such a capability is required for a...
115
click to vote
PPSN
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. In this paper we investigate the usefulness of a new operator, inver-over, for an evolutionary algorithm for the TSP. Inver-over is based on simple inversion, however, kn...