Results 1 
7 of
7
Applying parallel computation algorithms in the design of serial algorithms
 J. ACM
, 1983
"... Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for design ..."
Abstract

Cited by 247 (7 self)
 Add to MetaCart
(Show Context)
Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A d ~ eframework d for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in sorting, selection, minimumspanningtree, shortest route, maxflow, and matrix multiplication problems, as well as in scheduling and locational problems.
Parallel Query Processing
 ACM Computing Surveys
, 1993
"... With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques ..."
Abstract

Cited by 62 (0 self)
 Add to MetaCart
With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques available for addressing these issues. The focus of the paper is on the join operation with both sortmerge join and hash joins being considered. Three types of parallelism can be exploited, namely intraoperator, interoperator, and interquery parallelism. In intraoperator parallelism the major issue is task creation, and the objective is to split a join operation into tasks in a manner such that the load can be spread evenly across a given number of processors. This is a challenge when the values on the join attribute are not uniformly distributed. Interoperator parallelism can be achieved either through parallel execution of independent operations or through pipelining. In either case,...
DASD Dancing: A Disk Load Balancing Optimization Scheme for VideoonDemand Computer Systems
, 1995
"... For a videoondemand computer system we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load balancing scheme consists of two stages. The static stage determines good assignments of videos t ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
For a videoondemand computer system we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load balancing scheme consists of two stages. The static stage determines good assignments of videos to groups of striped disks. The dynamic phase uses these assignments, and features a DASD dancing algorithm which performs realtime disk scheduling in an effective manner. Our scheme works synergistically with disk striping. We examine the performance of the DASD dancing algorithm via simulation experiments.
Disk Load Balancing for VideoonDemand Systems
 ACM Multimedia Systems
, 1997
"... For a videoondemand computer system we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load balancing scheme consists of two components. The static component determines good assignments of vide ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
(Show Context)
For a videoondemand computer system we propose a scheme which balances the load on the disks, thereby helping to solve a performance problem crucial to achieving maximal video throughput. Our load balancing scheme consists of two components. The static component determines good assignments of videos to groups of striped disks. The dynamic component uses these assignments, and features a "DASD dancing" algorithm which performs realtime disk scheduling in an effective manner. Our scheme works synergistically with disk striping. We examine the performance of the proposed algorithm via simulation experiments. 1 Introduction Consider a videoondemand (VOD) computer system consisting of a central processor and a collection of shared disks, sometimes known as direct access storage devices (DASDs). VOD computer systems must be able to "play" multiple streams of many different videos simultaneously, based on customer demand. Most videos will be stored most cost effectively on disk. (A few ...
Optimization Issues in Multimedia Systems
 International Journal of Intelligent Systems
, 1998
"... Multimedia systems must meet stringent realtime performance criteria in order to satisfy customer requirements. Because of these criteria, and because of the rich structure inherent in videoondemand (VOD) applications, there is both need and opportunity to employ sophisticated mathematical optimi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Multimedia systems must meet stringent realtime performance criteria in order to satisfy customer requirements. Because of these criteria, and because of the rich structure inherent in videoondemand (VOD) applications, there is both need and opportunity to employ sophisticated mathematical optimization techniques. In this paper we present an overview of several recent optimization algorithms for multimedia systems, concentrating on the techniques themselves. In particular, we will describe a VOD batching algorithm known as the maximum factored queue length policy, based in part on solving a simple instance of a socalled mathematical resource allocation problem. Next we will describe an optimization problem arising when employing a VOD technique known as adaptive piggybacking. This problem can be solved as a dynamic program, and the scheme which results is known as the snapshot algorithm. Finally we will describe a socalled DASD dancing algorithm for VOD disk load balancing, which ...
THE MAXIMUM COVERAGE LOCATION PROBLEM*
"... Abstract. In this paper we define and discuss the following problem which we call the maximum coverage location problem. A transportation network is given together with the locations of customers and facilities. Thus, for each customer i, a radius ri is known such that customer i can currently be se ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we define and discuss the following problem which we call the maximum coverage location problem. A transportation network is given together with the locations of customers and facilities. Thus, for each customer i, a radius ri is known such that customer i can currently be served by a facility which is located within a distance of r, from the location of customer i. We consider the problem from the point of view of a new company which is interested in establishing new facilities on the network so as to maximize the company's &quot;share of the market. &quot; Specifically, assume that the company gains an amount of wi in case customer i decides to switch over to one of the new facilities. Moreover, we assume that the decision to switch over is based on proximity only, i.e., customer i switches over to a new facility only if the latter is located at a distance less than ri from i. The problem is to locate p new facilities so as to maximize the total gain. The maximum coverage problem is a relatively complicated one even on treenetworks. This is because one aspect of the problem is the selection of the subset of customers to be taken over. Nevertheless, we present an O(nZp) algorithm for this problem on a tree. Our approach can be applied to other similar problems which are discussed in the paper. 1. Introduction. We
A TWORESOURCE ALLOCATION PROBLEM SOLVABLE IN LINEAR TIME*
"... The allocation problem discussed here is as follows. The processing time of a task is a linear function caxby of amounts x, y of resources allocated to it. where t.a, h are positive constants. Given the amounts X and Y of available resources, we wish to allocate them among n independent tasks so a ..."
Abstract
 Add to MetaCart
The allocation problem discussed here is as follows. The processing time of a task is a linear function caxby of amounts x, y of resources allocated to it. where t.a, h are positive constants. Given the amounts X and Y of available resources, we wish to allocate them among n independent tasks so as to minimize the maximal completion time. We solve this problem in llnear time. Introduction. The complexity of the linear programming problem is a central question in the interface between operations research and computer science. It is still an open question whether an m x n problem can be solved within a polynomial number p(m, n) of arithmetic operations. Another direction of research is that of exploring the complexities of structured linear programming problems (see [M 1, M2,