Abstract
Several effective algorithms are presented for the optimal allocation of computer resources in a proposed stream-oriented parallel-processing scheme for database operations. These algorithms can be utilized to obtain the optimal allocation of memory resources for every type of query in sequential-processing environments, parallel-processing environments with shared-memory multiprocessors, and distributed-processing environments. The computation complexities of the proposed algorithms are analyzed and used to clarify the effectiveness of those algorithms.
| Original language | English |
|---|---|
| Pages | 316-323 |
| Number of pages | 8 |
| Publication status | Published - 1989 Jun 1 |
| Externally published | Yes |
| Event | 9th International Conference on Distributed Computing Systems - Newport Beach, CA, USA Duration: 1989 Jun 5 → 1989 Jun 9 |
Other
| Other | 9th International Conference on Distributed Computing Systems |
|---|---|
| City | Newport Beach, CA, USA |
| Period | 89/6/5 → 89/6/9 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications