Results 1  10
of
40
Iterative modulo scheduling: An algorithm for software pipelining loops
 In Proceedings of the 27th Annual International Symposium on Microarchitecture
, 1994
"... Modulo scheduling is a framework within which a wide variety of algorithms and heuristics may be defined for software pipelining innermost loops. This paper presents a practical algorithm, iterative modulo scheduling, that is capable of dealing with realistic machine models. This paper also characte ..."
Abstract

Cited by 323 (4 self)
 Add to MetaCart
(Show Context)
Modulo scheduling is a framework within which a wide variety of algorithms and heuristics may be defined for software pipelining innermost loops. This paper presents a practical algorithm, iterative modulo scheduling, that is capable of dealing with realistic machine models. This paper also characterizes the algorithm in terms of the quality of the generated schedules as well the computational expense incurred.
Iterative Modulo Scheduling
, 1995
"... Modulo scheduling is a framework within which algorithms for the software pipelining of innermost loops may be defined. The framework specifies a set of constraints that must be met in order to achieve a legal modulo schedule. A wide variety of algorithms and heuristics can be defined within this fr ..."
Abstract

Cited by 94 (7 self)
 Add to MetaCart
Modulo scheduling is a framework within which algorithms for the software pipelining of innermost loops may be defined. The framework specifies a set of constraints that must be met in order to achieve a legal modulo schedule. A wide variety of algorithms and heuristics can be defined within this framework. Little work has been done to evaluate and compare alternative algorithms and heuristics for modulo scheduling from the viewpoints of schedule quality as well as computational complexity. This, along with a vague and unfounded perception that modulo scheduling is computationally expensive as well as difficult to implement, have inhibited its incorporation into product compilers. This report presents iterative modulo scheduling, a practical algorithm that is capable of dealing with realistic machine models. The report also characterizes the algorithm in terms of the quality of the generated schedules as well the computational expense incurred.
Deciding linear inequalities by computing loop residues
 Journal of the ACM
, 1981
"... ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is generahzed, first to real feaslbdlty of mequahues m two variables and arbitrary coefficients, ..."
Abstract

Cited by 86 (0 self)
 Add to MetaCart
ABSTRACT V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is generahzed, first to real feaslbdlty of mequahues m two variables and arbitrary coefficients, and ultimately to real feaslbdlty of arbitrary sets of hnear mequahtles The method is well suited to apphcatlons m program verification KEY WORDS AND PHRASES theorem proving, decision procedures, program venficauon, linear programmmg CRCATEGORIES 3 15,369,521,532,541 1. lntroductton Procedures for deciding whether a given set of l inear inequalities has solutions often play an important role in deductive systems for program verification. Array bounds checks and tests on index variables are but two of the many common programming constructs that give rise to formulas involving inequalities. A number of approaches have been used to decide the feasibdity of sets of inequalities [3, 8, 9, 16, 22], ranging from goaldriven rewriting mechanisms [27] to the powerful simplex techniques [8]
Redundant trees for preplanned recovery in arbitrary vertex—Redundant or edge redundant graphs
 IEEE/ACM Trans. Netw
, 1999
"... Abstract—We present a new algorithm which creates redundant trees on arbitrary noderedundant or linkredundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned ..."
Abstract

Cited by 75 (4 self)
 Add to MetaCart
Abstract—We present a new algorithm which creates redundant trees on arbitrary noderedundant or linkredundant networks. These trees are such that any node is connected to the common root of the trees by at least one of the trees in case of node or link failure. Our scheme provides rapid preplanned recovery of communications with great flexibility in the topology design. Unlike previous algorithms, our algorithm can establish two redundant trees in the case of a node failing in the network. In the case of failure of a communications link, our algorithm provides a superset of the previously known trees. Index Terms—Graph theory, multicasting, network recovery, network robustness, routing, trees. I.
Software Pipelining
, 1995
"... Utilizing parallelism at the instruction level is an important way to improve performance. Since the time spent in loop execution dominates total execution time, a large body of optimizations focus on decreasing the time to execute each iteration. Software pipelining is a technique that reforms t ..."
Abstract

Cited by 56 (1 self)
 Add to MetaCart
Utilizing parallelism at the instruction level is an important way to improve performance. Since the time spent in loop execution dominates total execution time, a large body of optimizations focus on decreasing the time to execute each iteration. Software pipelining is a technique that reforms the loop so that a faster execution rate is realized. Iterations are executed in overlapped fashion to increase parallelism. 1 Let ABC n represent a loop containing operations A, B, C that is executed n times. Although the operations of a single iteration can be parallelized, more parallelism may be achievable if the entire loop is considered rather than a single iteration. The software pipelining transformation utilizes the fact that a loop ABC n is equivalent to ABCA n\Gamma1 BC. Although the operations contained in the loop do not change, the operations are from different iterations of the original loop. Various algorithms for software pipelining exist. A comparison of ...
ªA GraphBased Method for Face Identification from a Single 2D
 Line Drawing,º Technical Memo DRCTM01, School of Mechanical and Production Eng., Nanyang Technological Univ
, 2000
"... AbstractÐThe faces in a 2D line drawing of an object provide important information for the reconstruction of its 3D geometry. In this paper, a graphbased optimization method is proposed for identifying the faces in a line drawing. The face identification is formulated as a maximum weight clique pro ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
(Show Context)
AbstractÐThe faces in a 2D line drawing of an object provide important information for the reconstruction of its 3D geometry. In this paper, a graphbased optimization method is proposed for identifying the faces in a line drawing. The face identification is formulated as a maximum weight clique problem. This formulation is proven to be equivalent to the formulation proposed by Shpitalni and Lipson in [1]. The advantage of our formulation is that it enables us to develop a much faster algorithm to find the faces in a drawing. The significant improvement in speed is derived from two algorithms provided in this paper: The depthfirst graph search for quickly generating possible faces from a drawing and the maximum weight clique finding for obtaining the optimal face configurations of the drawing. The experimental results show that our algorithm generates the same results of face identification as Shpitalni and Lipson's, but is much faster when dealing with objects of more than 20 faces. Index TermsÐ3D object reconstruction, depthfirst search, face identification, graph algorithms, line drawing interpretation, maximum weight clique problem. æ 1
Union of All the Minimum Cycle Bases of a Graph
, 1997
"... The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cycle vector space of a graph, a minimum cycle basis can be computed in polynomial time using an algorithm of [Horton, 1987]. But the set of cycles corresponding to a minimum basis is not always relev ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cycle vector space of a graph, a minimum cycle basis can be computed in polynomial time using an algorithm of [Horton, 1987]. But the set of cycles corresponding to a minimum basis is not always relevant for analyzing the cyclic structure of a graph. This restriction is due to the fact that a minimum cycle basis is generally not unique for a given graph. Therefore, the smallest canonical set of cycles which describes the cyclic structure of a graph is the union of all the minimum cycle bases . This set of cycles is called the set of relevant cycles and denoted by CR . A relevant cycle can also be defined as a cycle which is not the sum of shorter cycles. A polynomial algorithm is presented that computes a compact representation of the potentially exponentialsized set CR in O(m 3 ) (where denotes the cyclomatic number). This compact representation consists of a polynomial nu...
Design guidelines for deadlock handling strategies in flexible manufacturing systems
 INTL. JRNL. OF FLEXIBLE MANUFACTURING SYSTEMS
, 1997
"... Petri net modeling has clearly illuminated the need for formal structural analysis of Flexible Manufacturing Systems. Petri nets are not, however, the only formal models capable of supporting such analysis. Indeed, it is our position that structural analysis of the FMS is a fundamental design activi ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Petri net modeling has clearly illuminated the need for formal structural analysis of Flexible Manufacturing Systems. Petri nets are not, however, the only formal models capable of supporting such analysis. Indeed, it is our position that structural analysis of the FMS is a fundamental design activity which must be defined independently of any particular modeling paradigm. This paper attempts to define FMS structural analysis and provides guidelines for developing FMS Structural Control Policies, SCP's. The FMS is a discrete event system and as such is structurally characterized by its state space. This state space can be represented by a State Transition Diagram, i.e. a directed graph with FMS states being vertices and directed edges being state transition. The objective of structural analysis is to characterize regions of the state space that are structurally sound. Structural Control Policies, SCP's, then assure that the FMS operates within these structurally sound regions. Deadlock has emerged as the paramount structural property for FMS's, and therefore, structural analysis emphasizes characterization of those state space regions that are safe. SCP's must then assure that the FMS operates within its safe subspace.
ContentBased Retrieval of Technical Drawings
 Special Issue of International Journal of Computer Applications in Technology (IJCAT) &quot;Models
, 2004
"... This paper presents a new approach to classify, index and retrieve technical drawings by content. Our work uses spatial relationships, shape geometry and highdimensional indexing mechanisms to retrieve complex drawings from CAD databases. This contrasts with conventional approaches which use most ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
This paper presents a new approach to classify, index and retrieve technical drawings by content. Our work uses spatial relationships, shape geometry and highdimensional indexing mechanisms to retrieve complex drawings from CAD databases. This contrasts with conventional approaches which use mostly textual metadata for the same purpose. Creative designers and draftspeople often reuse data from previous projects, publications and libraries of readytouse components. Usually, retrieving these drawings is a slow, complex and errorprone endeavor, requiring either exhaustive visual examination, a solid memory, or both. Unfortunately, the widespread use of CAD systems, while making it easier to create and edit drawings, exacerbates this problem, insofar as the number of projects and drawings grows enormously, without providing adequate searching mechanisms to support retrieving these documents. We describe an approach that supports automatic indexation of technical drawing databases through drawing simplification, feature extraction and efficient algorithms to index large amounts of data. We describe in detail all the steps of our classification 1 process to contentbased retrieval of technical drawings (CAD) and present results from usability tests on our prototype.
Network Restorability Design Using Preconfigured Trees, Cycles, and Mixtures of Pattern Types
 TRLABS
, 2000
"... ..."
(Show Context)