A technique for drawing directed graphs

Gansner, Emden R.; Koutsofios, Eleftherios; North, Stephen C.; Vo, Kiem‐Phong

doi:10.1109/32.221135

Cited by 505 publications

(408 citation statements)

References 11 publications

Supporting

Mentioning

362

Contrasting

Unclassified

Order By: Relevance

“…We adapted the open-source program dot 1 which uses a median heuristic coupled with an adjacent-exchange post-processing step [13]. New permutations generated by these heuristics are rejected if they lead to an increase in edge crossings according to our modified crossing matrix.…”

Section: Methodsmentioning

confidence: 99%

Visualizing Related Metabolic Pathways in Two and a Half Dimensions

Brandes

Dwyer

Schreiber

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a method for visualizing a set of related metabolic pathways using 2 1 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full picture of subtle and significant differences among the pathways. Layouts are determined by a global layout of the union of all pathway-representing graphs using a variant of the proven Sugiyama approach for layered graph drawing that allows edges to cross if they appear in different graphs.

show abstract

Section: Methodsmentioning

confidence: 99%

Visualizing Related Metabolic Pathways in Two and a Half Dimensions

Brandes

Dwyer

Schreiber

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…It is fair to say that in the worst case scenario code improvements are restricted to at most 180 Cobol programs. Given the total number of Cobol modules in the analyzed portfolio (23,004) this constitutes approximately 0.78%.…”

Section: Top Executed Db2 Codementioning

confidence: 99%

“…To do this we required a technology that is suited to process efficiently a large volume of source files. Let us recall that we dealt with a software portfolio of a large size (23,004 Cobol programs that implement 246 applications). Therefore we opted for incorporating Perl.…”

Section: Getting the Datamentioning

confidence: 99%

Reducing operational costs through MIPS management

Kwiatkowski

Verhoef

2015

Science of Computer Programming

View full text Add to dashboard Cite

h i g h l i g h t s• We present an approach to reducing CPU usage costs in large organizations.• Source code scans are used to identify low-risk high-yield SQL-tuning opportunities.• Our approach is suitable for deployment in large business-critical IT-portfolios.• Case study: a mainframe production environment of 246 applications (19.7M+ LOC). a r t i c l e i n f o a b s t r a c t We focus on an approach to reducing the costs of running applications. MIPS, which is a traditional acronym for millions of instructions per second, have evolved to become a measurement of processing power and CPU resource consumption. The need for controlling MIPS attributed costs is indispensable given their significant contribution to operational costs. In this paper we investigate a large mainframe production environment running 246 Cobol applications of an organization operating in the financial sector. We found that the vast majority of the top CPU intensive operations in the production environment involve the use of DB2. We propose approaching portfolio-wide efforts to reduce CPU resource consumption from the source code perspective. Our technique is low-risk, lowcost and involves SQL code improvements of small scale. We show how to analyze a mainframe environment in an industrial setting, and to locate the most promising source code segments for optimizing runtime usage. Our approach relies on the mainframe usage data, facts extracted from source code, and is supported by a real-world SQL tuning project. After applying our technique to a portfolio of Cobol applications running on the mainframe our estimates suggested a possible drop in the attributed monthly CPU usage by as much as 16.8%. The approach we present is suited for facilitation within a mainframe environment of a large organization.

show abstract

“…The following discussion assumes the hierarchy is drawn top-to-bottom; of course it is simple to orient the hierarchy in other ways by pre-and post-processing. Level assignment employs an integer network simplex solver previously developed for the dot layout program [12]. In applying this solver, Dynadag maintains an auxiliary graph Ý whose nodes are interpreted as variables and edges as constraints, as shown in tables 3 and 4.…”

Section: Rerank Nodesmentioning

confidence: 99%

Online Hierarchical Graph Drawing

North

Woodhull

2002

Graph Drawing

View full text Add to dashboard Cite

Abstract. We propose a heuristic for dynamic hierarchical graph drawing. Applications include incremental graph browsing and editing, display of dynamic data structures and networks, and browsing large graphs. The heuristic is an online interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are incrementally stable and readable through long editing sequences. We measured the performance of a prototype implementation.

show abstract

A technique for drawing directed graphs

Cited by 505 publications

References 11 publications

Visualizing Related Metabolic Pathways in Two and a Half Dimensions

Visualizing Related Metabolic Pathways in Two and a Half Dimensions

Reducing operational costs through MIPS management

Online Hierarchical Graph Drawing

Contact Info

Product

Resources

About