Sciweavers

189 search results - page 13 / 38
» Scheduling Issues in Optimistic Parallelization
Sort
View
HPCA
1996
IEEE
15 years 1 months ago
Register File Design Considerations in Dynamically Scheduled Processors
We have investigated the register file requirements of dynamically scheduled processors using register renaming and dispatch queues running the SPEC92 benchmarks. We looked at pro...
Keith I. Farkas, Norman P. Jouppi, Paul Chow
PARLE
1993
15 years 1 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
EPIA
1999
Springer
15 years 1 months ago
YapOr: an Or-Parallel Prolog System Based on Environment Copying
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
79
Voted
ICC
2008
IEEE
110views Communications» more  ICC 2008»
15 years 4 months ago
PAQ: A Starvation-Resistant Alternative to Proportional Fair
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...
Soshant Bali, Sridhar Machiraju, Hui Zang
VLDB
1995
ACM
214views Database» more  VLDB 1995»
15 years 1 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