Results 1  10
of
21
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 281 (3 self)
 Add to MetaCart
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 84 (6 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.
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 43 (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 ...
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 15 (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) "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 9 (3 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
"... ..."
Discovering and Quantifying Mean Streets: A Summary of Results
, 2007
"... Mean streets represent those connected subsets of a spatial network whose attribute values are significantly higher than expected. Discovering and quantifying mean streets is an important problem with many applications such as detecting highcrimedensity streets and high crash roads (or areas) for ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Mean streets represent those connected subsets of a spatial network whose attribute values are significantly higher than expected. Discovering and quantifying mean streets is an important problem with many applications such as detecting highcrimedensity streets and high crash roads (or areas) for public safety, detecting urban cancer disease clusters for public health, detecting human activity patterns in asymmetric warfare scenarios, and detecting urban activity centers for consumer applications. However, discovering and quantifying mean streets in large spatial networks is computationally very expensive due to the difficulty of characterizing and enumerating the population of streets to define a norm or expected activity level. Previous work either focuses on statistical rigor at the cost of computational exorbitance, or
Distributed Algorithms for Attack Localization in AllOptical Networks
 Network and Distributed System Security Symposium, sponsored by the Internet Society, session
, 1998
"... AllOptical Networks provide ultrafast data rates, but present a new set of challenges for network security. We present a new algorithm for attack localization in networks. The algorithm is distributed and requires only local information. The algorithm can localize attacks for a variety of network ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
AllOptical Networks provide ultrafast data rates, but present a new set of challenges for network security. We present a new algorithm for attack localization in networks. The algorithm is distributed and requires only local information. The algorithm can localize attacks for a variety of network applications. This algorithm is particularly well suited to the requirements of AllOptical Networks because it provides fast, reliable response to attacks. In particular we apply it to two common forms of rapid optical network restoration: automatic protection switching and loopback.
Cycle Vector Space Algorithms for Enumerating all Cycles of a Planar Graph
 Journal of Parallel Algorithms and Applications
, 1995
"... We present a new and elegant cycle vector space algorithm that runs in O(n 2 \Delta ff) steps and needs O(n) space for enumerating all the cycles of a planar graph with n vertices, where ff is the total number of simple cycles in the graph. Unlike backtrack algorithms, cycle vector space algorith ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a new and elegant cycle vector space algorithm that runs in O(n 2 \Delta ff) steps and needs O(n) space for enumerating all the cycles of a planar graph with n vertices, where ff is the total number of simple cycles in the graph. Unlike backtrack algorithms, cycle vector space algorithms for this problem are suitable for parallelization. A parallel version of this algorithm along with a parallel version of Syslo's O(n \Delta ff) step algorithm for the same problem are given on an exclusiveread, exclusivewrite parallel RAM model with p processors. The results of an implementation of our parallel algorithm on a meshconnected SIMD computer are also presented. Keywords: enumerating all cycles, cycle basis, planar graphs, EREW PRAM algorithm, meshconnected SIMD computer. 1 Introduction A graph G = (V; E) is a collection of objects, represented by a set of vertices V and relations among them, represented by a set of edges E. A graph G is said to be planar if there exists so...