Results 1 - 10 of 177

Slack-based Lower Bound and Heuristic for . . .

by Anantaram Balakrishnan, Srimathy Gopalakrishnan, Atsushi Kurebayashi , 1993
"... This paper addresses optimal job sequencing decisions for various classes of permutation flowshops. We first describe a framework to classify flowshop scheduling problems based on the level of intermediate storage, job transfer mechanism, and objective function. We discuss the interrelationships bet ..."
Abstract - Add to MetaCart
between various flowshop models, develop a new slack-based lower bound for the total processing time of each machine, and describe an assignment-patching heuristic to generate effective job sequences. Our computational results show that, compared to previous approaches, the slack-based lower bound

Scanning Polyhedra with DO Loops

by Corinne Ancourt, François Irigoin , 1991
"... Supercompilers perform complex program transformations which often result in new loop bounds. This paper shows that, under the usual assumptions in automatic parallelization, most transformations on loop nests can be expressed as affine transformations on integer sets de ned by polyhedra and that th ..."
Abstract - Cited by 216 (5 self) - Add to MetaCart
dynamic overhead due to some bound slackness and compilation complexity but the resulting code is always correct. These algorithms can be used to interchange or block loops regardless of the loop bounds or the blocking strategy and to safely exchange array parts between two levels of a memory hierarchy

Compact Routing with Slack

by Michael Dinitz , 2007
"... Given a weighted graph G = (V, E), a compact routing scheme is a distributed algorithm for forwarding packets from any source to any destination. The fundamental tradeoff is between the space used at each node and the stretch of the total route, measured by the multiplicative factor between the act ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
the actual distance traveled and the length of the shortest possible route. We extend the normal definition with a slack parameter ffl, which allows us to ignore up to ffln2 of the shortest pairwise routes and give a guarantee on the remaining ones. For constant ffl we give constant stretch, polylogarithmic

Leveraging protocol knowledge in slack matching

by Girish Venkataramani, Seth C. Goldstein - In ICCAD , 2006
"... Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, the resulting design performs slower than when the communication rate is matched. This can be remedied by inserting pipeli ..."
Abstract - Cited by 12 (9 self) - Add to MetaCart
pipeline buffers (to temporarily hold data), allowing the producer to proceed if the consumer is not ready to accept data. The problem of deciding which channels need these buffers (and how many) for an arbitrary communication profile is called the slack matching problem; the optimal solution

The Utilization Bound of Uniprocessor Preemptive Slack-Monotonic Scheduling is 50

by Björn Andersson , Björn Andersson , Björn Andersson - In Proc. of ACM Symp. On Applied Computing , 2008
"... Abstract Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%. The Utilization Bound of ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%. The Utilization Bound

Slack Stealing Job Admission Control

by Atlas Alia, Alia K. Atlas, Azer Bestavros
"... In this paper, we present Slack Stealing Job Admission Control (SSJAC)|a methodology for scheduling periodic rm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack ..."
Abstract - Add to MetaCart
In this paper, we present Slack Stealing Job Admission Control (SSJAC)|a methodology for scheduling periodic rm-deadline tasks with variable resource requirements, subject to controllable Quality of Service (QoS) constraints. In a system that uses Rate Monotonic Scheduling, SSJAC augments the slack

Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems

by J.A. Hoogeveen, S.L. van de Velde , 1995
"... ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract not found

Slack: A New Performance Metric for Parallel Programs

by Jeffrey K. Hollingsworth, Barton P. Miller , 1994
"... Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new metr ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new

Compact Routing with Slack in Low Doubling Dimension ABSTRACT

by Goran Konjevod, Andréa W. Richa, Hai Yu, Donglin Xia
"... We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek nameindependent routing schemes with (1 + ɛ) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a s ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
We consider the problem of compact routing with slack in networks of low doubling dimension. Namely, we seek nameindependent routing schemes with (1 + ɛ) stretch and polylogarithmic storage at each node: since existing lower bound precludes such a scheme, we relax our guarantees to allow for (i) a

Slack: A New Performance Metric for Parallel Programs

by Jeffrey Hollingsworth Barton, Jeffrey K. Hollingsworth, Barton P. Miller , 1994
"... Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new me ..."
Abstract - Add to MetaCart
Critical Path Profiling is a technique that provides guidance to help programmers try to improve the running time of their program. However, Critical Path Profiling provides only an upper bound estimate of the improvement possible in a parallel program execution. In this paper, we present a new
Results 1 - 10 of 177