7303 search results - page 1379 / 1461 » Optimality for dynamic patterns |
119
click to vote
HICSS
1995
IEEE
15 years 5 months ago
1995
IEEE
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
118
click to vote
PLDI
1995
ACM
15 years 5 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
109
click to vote
VLDB
1995
ACM
15 years 5 months ago
1995
ACM
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
AIPS
2007
15 years 4 months ago
2007
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
119
click to vote
USENIX
2008
15 years 4 months ago
2008
zation is a well-known method of abstracting physical resources and of separating the manipulation and use of logical resources from their underlying implementation. We have used ...