Results 1  10
of
10
Scheduling for LargeScale OnDemand Data Broadcasting
 IEEE INFOCOM
, 1998
"... Abstract — Recent advances in telecommunications have enabled the deployment of broadcastbased widearea information services that provide ondemand data access to very large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient ..."
Abstract

Cited by 78 (4 self)
 Add to MetaCart
Abstract — Recent advances in telecommunications have enabled the deployment of broadcastbased widearea information services that provide ondemand data access to very large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient, online scheduling algorithms that can balance individual and overall performance, and can scale in terms of data set sizes, client populations, and broadcast bandwidth. In this study we introduce a parameterized algorithm that provides good performance across all of these criteria and can be tuned to emphasize either average or worst case waiting time. Unlike previous work on low overhead scheduling, the algorithm is not based on estimates of the access probabilities of items, but rather, it makes scheduling decisions based on the current queue state, allowing it to easily adapt to changes in the intensity and distribution of the workload. We examine the performance of the algorithm using a simulation model.
Global Search Methods For Solving Nonlinear Optimization Problems
, 1997
"... ... these new methods, we develop a prototype, called Novel (Nonlinear Optimization Via External Lead), that solves nonlinear constrained and unconstrained problems in a unified framework. We show experimental results in applying Novel to solve nonlinear optimization problems, including (a) the lear ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
... these new methods, we develop a prototype, called Novel (Nonlinear Optimization Via External Lead), that solves nonlinear constrained and unconstrained problems in a unified framework. We show experimental results in applying Novel to solve nonlinear optimization problems, including (a) the learning of feedforward neural networks, (b) the design of quadraturemirrorfilter digital filter banks, (c) the satisfiability problem, (d) the maximum satisfiability problem, and (e) the design of multiplierless quadraturemirrorfilter digital filter banks. Our method achieves better solutions than existing methods, or achieves solutions of the same quality but at a lower cost.
The LEDA class real number
 MaxPlanck Institut Inform
, 1996
"... We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are ffl The userinterface is similar to that of the bu ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are ffl The userinterface is similar to that of the builtin data type double.
Hopf Algebras in General and in Combinatorial Physics: a practical introduction
, 802
"... Abstract. This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of Hopf al ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of Hopf algebra arise naturally. The text contains many exercises, some taken from physics, aimed at expanding and exemplifying the concepts introduced. 1.
Parallel Processing (ICA3PP96) Preemptive Job Scheduling in Star Graph Networks
"... In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1 ..."
Abstract
 Add to MetaCart
In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1
Contents
, 1996
"... We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are The user{interface is similar to that of the built{i ..."
Abstract
 Add to MetaCart
We describe the implementation of the LEDA [MN95, Nah95] data type real. Every integer is a real and reals are closed under the operations addition, subtraction, multiplication, division and squareroot. The main features of the data type real are The user{interface is similar to that of the built{in data type double. All comparison operators f>;; <;;=g are exact. In order to determine the sign of a real number x the data type rst computes a rational number q such that jxj q implies x = 0 and then computes an approximation of x of sucient precision to decide the sign of x. The user may assist the data type by providing a separation bound q. The data type also allows to evaluate real expressions with arbitrary precision. One may either set the mantissae length of the underlying
oating point system and then evaluate the expression with that mantissa length or one may specify an error bound q. The data type then computes an approximation with absolute error at most q.
DEDICATION GLOBAL SEARCH METHODS FOR SOLVING NONLINEAR OPTIMIZATION PROBLEMS
"... In this thesis, we present new methods for solving nonlinear optimization problems. These problems are di cult to solve because the nonlinear constraints form feasible regions that are di cult to nd, and the nonlinear objectives contain local minima that trap descenttype search methods. In order to ..."
Abstract
 Add to MetaCart
(Show Context)
In this thesis, we present new methods for solving nonlinear optimization problems. These problems are di cult to solve because the nonlinear constraints form feasible regions that are di cult to nd, and the nonlinear objectives contain local minima that trap descenttype search methods. In order to nd good solutions in nonlinear optimization, we focus on the following two key issues: how to handle nonlinear constraints and how to escape from local minima. We use a Lagrangemultiplierbased formulation to handle nonlinear constraints, and develop Lagrangian methods with dynamic control to provide faster and more robust convergence. We extend the traditional Lagrangian theory for the continuous space to the To my wife Lei, my parents, and my son Charles discrete space and develop e cient discrete Lagrangian methods. To overcome local minima, we design a new tracebased globalsearch method that relies on an external traveling trace to pull a search trajectory out of a local optimum in a continuous fashion without having to restart the search from a new starting point. Good starting points identi ed in the global search are used in the local search to identify true local optima. By combining these new methods, we develop a prototype, called Novel (Nonlinear Optimization Via External Lead),
Preemptive Job Scheduling in Star Graph Networks
, 1996
"... In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1 Introduction One of ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs. 1 Introduction One of the attractive topologies for constructing the symmetric interconnection networks is the star graph [AK89, AK87]. The star graph, being a member of the class of Cayley graphs, has been shown to possess appealing features including low degree of the node, small diameter, partitionability, symmetry, and high degree of faulttolerance. For this reason, recently much research has been directed toward studying properties of these star graphs [DT94, QMA92], its faulttolerance aspects [Lat93], or implementing various algorithms on it [QAM94, MS90, FA91, MS92]. When parallel algorithms are mapped and implemented on a massively parallel architecture, the dimension of the network plays an important r...
Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter
, 1996
"... We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic i ..."
Abstract
 Add to MetaCart
(Show Context)
We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic in the number of nodes, is optimally fault tolerant and can be defined for an arbitrary number of nodes. 1 Introduction Design of a communication network is an integral part of developing any distributed and parallel processing system. A communication network is usually modeled by a graph where the nodes (vertices) denote the computing elements and the the edges (arcs) denote the communication channels; if the channels are bidirectional, the graph is undirected and if the channels are unidirectional thy graph is directed. Desirable features for a good interconnection topology include properties like low degree, regularity, small diameter, high fault tolerance (connectivity), efficient routi...
Super Rotator: . . . Network Graph of Sublogarithmic Diameter
, 1996
"... We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic i ..."
Abstract
 Add to MetaCart
We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the indegrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic in the number of nodes, is optimally fault tolerant and can be defined for an arbitrary number of nodes.