Sciweavers

3202 search results - page 381 / 641
» Memory access scheduling
Sort
View
IPPS
1996
IEEE
15 years 10 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
VLDB
1995
ACM
214views Database» more  VLDB 1995»
15 years 10 months ago
Dynamic Multi-Resource Load Balancing in Parallel Database Systems
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
Erhard Rahm, Robert Marek
EDBT
2008
ACM
140views Database» more  EDBT 2008»
15 years 8 months ago
Database Servers Tailored to Improve Energy Efficiency
Database software can be tailored for specific application domains and their required functionality, for specific hardware and its characteristics, or for other purposes. This bri...
Goetz Graefe
188
Voted
ENTCS
2006
137views more  ENTCS 2006»
15 years 6 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
151
Voted
TC
1998
15 years 6 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen