Filters








1,350,259 Hits in 4.5 sec

Optimization of range checking

Victoria Markstein, Peter Markstein, John Cocke
2004 SIGPLAN notices  
We are sorry to report the recent death of our colleague and coauthor, John Cocke. We miss his friendship, wise counsel, and deep insights.  ...  More recent work has taken range checking optimization significantly beyond what we attempted, including outer loop optimizations and optimization in the presence of multithreading.  ...  The aggressive optimization of range checks kept the costs at an acceptable level. We believe that the compilers have been recoded in C since we left IBM.  ... 
doi:10.1145/989393.989402 fatcat:jefm5ceagjdctjaokel67ymr4a

A fresh look at optimizing array bound checking

Rajiv Gupta
1990 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90  
The optimizations reduce the program execution time and the object code size through elimination of redundant checks, propagation of checks out of loops, and combination of multiple checks into a single  ...  In addition to the elimination of range check:s, the optimizations discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile-time analysis.  ...  Traditional Code Optimizations vs Range Check Optimizations The results of range check optimizations can be influenced by other code optimizations.  ... 
doi:10.1145/93542.93581 dblp:conf/pldi/Gupta90 fatcat:j2ku2kisvbcjtn5wchhvbwct4a

A fresh look at optimizing array bound checking

Rajiv Gupta
1990 SIGPLAN notices  
The optimizations reduce the program execution time and the object code size through elimination of redundant checks, propagation of checks out of loops, and combination of multiple checks into a single  ...  In addition to the elimination of range check:s, the optimizations discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile-time analysis.  ...  Traditional Code Optimizations vs Range Check Optimizations The results of range check optimizations can be influenced by other code optimizations.  ... 
doi:10.1145/93548.93581 fatcat:m4fdic7xuveezdkjlgnczdjsei

Elimination of redundant array subscript range checks

Priyadarshan Kolte, Michael Wolfe
1995 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation - PLDI '95  
Range check optimization is especially beneficial in safety-oriented languages such as Ada, where * in range check optimization; q an implementation of a range check optimizer in our research  ...  We optimize the construction of the CIG by using families of checks as nodes of the CIG instead of range checks.  ... 
doi:10.1145/207110.207160 dblp:conf/pldi/KolteW95 fatcat:yp2sbvowvbgdnc6yfej7yleqmu

Elimination of redundant array subscript range checks

Priyadarshan Kolte, Michael Wolfe
1995 SIGPLAN notices  
Range check optimization is especially beneficial in safety-oriented languages such as Ada, where * in range check optimization; q an implementation of a range check optimizer in our research  ...  We optimize the construction of the CIG by using families of checks as nodes of the CIG instead of range checks.  ... 
doi:10.1145/223428.207160 fatcat:fqoszm6syndo3ctha4vsf37wvm

UNREPLICATED SPATIAL DESIGNS COMPARED USING OPTIMALITY CRITERIA

Tisha Maas, David Marx, Dr. Jeff Pedersen
2002 Conference on Applied Statistics in Agriculture  
First, the check patterns were compared using optimality criteria.  ...  In these situations, the researcher may choose to use only one replicate of each test variety and to include a "check" variety every so often so that the spatial variability of the field may be determined  ...  A-OPTIMALITY FOR LARGE RANGE (RANGE=20).  ... 
doi:10.4148/2475-7772.1202 fatcat:giskasjpmzhc7ll3ph4qcqwwj4

Progressive Optimization in Action [chapter]

V RAMAN, V MARKL, D SIMMEN, G LOHMAN, H PIRAHESH
2004 Proceedings 2004 VLDB Conference  
For selected queries of the workload we display the query plans with validity ranges as well as the placement of the various kinds of CHECK operators using the DB2 graphical plan explain tool.  ...  POP works by carefully calculating validity ranges for each plan operator under which the overall plan can be optimal.  ...  One of the properties is the validity range -the range of cardinalities flowing out of this operator under which this plan could be optimal.  ... 
doi:10.1016/b978-012088469-8/50141-8 fatcat:2ikqxbvqznaf7cx3mvx7zfrsiq

Progressive Optimization in Action [chapter]

Vijayshankar Raman, Volker Markl, David Simmen, Guy Lohman, Hamid Pirahesh
2004 Proceedings 2004 VLDB Conference  
For selected queries of the workload we display the query plans with validity ranges as well as the placement of the various kinds of CHECK operators using the DB2 graphical plan explain tool.  ...  POP works by carefully calculating validity ranges for each plan operator under which the overall plan can be optimal.  ...  One of the properties is the validity range -the range of cardinalities flowing out of this operator under which this plan could be optimal.  ... 
doi:10.1016/b978-012088469-8.50141-8 dblp:conf/vldb/RamanMSLP04 fatcat:7lfk2av53nf65nytkug35qvahq

Robust query processing through progressive optimization

Volker Markl, Vijayshankar Raman, David Simmen, Guy Lohman, Hamid Pirahesh, Miso Cilimdzic
2004 Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04  
Each CHECK has a condition that indicates the cardinality bounds within which a plan is valid. We compute this validity range through a novel sensitivity analysis of query plan operators.  ...  If the CHECK condition is violated, CHECK triggers re-optimization. POP has been prototyped in a leading commercial DBMS.  ...  Architecture of POP Extending a DBMS with POP capability involves: a) Adding logic to the plan generator of the query optimizer to determine the check range by determining the cardinality range for which  ... 
doi:10.1145/1007568.1007642 dblp:conf/sigmod/MarklRSLP04 fatcat:o6d22b3jofchbnt3lllibw4lca

Integrative health check reveals suboptimal levels in a number of vital biomarkers

Nikolaj Travica, Karin Ried, Robert Bujnowski, Avni Sali
2015 Advances in Integrative Medicine  
Acknowledgements We would like to thank all of the doctors and nurses who have been involved in the NIIM Health Check.  ...  For a number of biomarkers such as vitamin D, standard reference ranges are below the optimal ranges that are needed for optimal health.  ...  Iodine: optimal/standard reference range = 100-199 mg/L; vitamin D: standard reference range !50 nmol/L; optimal range !  ... 
doi:10.1016/j.aimed.2015.11.002 fatcat:o7diqgx2frawrnyinike54z63e

Enabling Efficient Alias Speculation

Soumyadeep Ghosh, Yongjun Park, Arun Raman
2015 Proceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM - LCTES'15  
Many code optimizations are made significantly more effective through the use of alias speculation.  ...  Consequently, improving the efficiency of alias speculation by reducing alias register requirements and rationalizing speculation validation checks is critical for the viability of SMARQ.  ...  We also thank Nick Johnson, Feng Liu, Taewook Oh, Jordan Fix, Harshad Deshmukh, and Sergiy Popovych for their feedback on various drafts of this paper.  ... 
doi:10.1145/2670529.2754964 dblp:conf/lctrts/GhoshPR15 fatcat:65wpuupyvffl3des4rng4xs5ii

Optimizing Ada on the fly

Sheri J. Bernstein, Robert S. Duff
1999 ACM SIGAda Ada Letters  
One of the features that makes Ada such a reliable programming language is its use of run-time constraint checks. However, such checks slow program execution and increase program size.  ...  such as the use of uninitialized variables.  ...  Thus, we are able to generate efficient IL for Ada without the impact on compile time, and without the added implementation complexity, associated with a traditional separate optimization phase.  ... 
doi:10.1145/319295.319321 fatcat:zb7hcj46irgldnvyj5hou74jvy

Optimizing Ada on the fly

Sheri J. Bernstein, Robert S. Duff
1999 Proceedings of the 1999 annual ACM SIGAda international conference on Ada - SIGAda '99  
One of the features that makes Ada such a reliable programming language is its use of run-time constraint checks. However, such checks slow program execution and increase program size.  ...  such as the use of uninitialized variables.  ...  Thus, we are able to generate efficient IL for Ada without the impact on compile time, and without the added implementation complexity, associated with a traditional separate optimization phase.  ... 
doi:10.1145/319294.319321 dblp:conf/sigada/BernsteinD99 fatcat:fwsg43hrgzfytiy3unbupjzy54

Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices [chapter]

Doron Rotem, Kurt Stockinger, Kesheng Wu
2005 Lecture Notes in Computer Science  
This technique partitions the attribute values into a number of ranges, called bins, and uses bitmap vectors to represent bins (attribute ranges) rather than distinct values.  ...  In this paper we study several strategies for optimizing the candidate check cost for multi-dimensional queries.  ...  The optimal construction of range histograms is discussed in [6, 3] .  ... 
doi:10.1007/11546924_22 fatcat:dsyx5tbeivfrbbuhvqi3wfnlfm

Combining control-flow integrity and static analysis for efficient and validated data sandboxing

Bin Zeng, Gang Tan, Greg Morrisett
2011 Proceedings of the 18th ACM conference on Computer and communications security - CCS '11  
The verifier checks the safety of the results of the optimizer, which removes the need to trust the rewriter and optimizer.  ...  We have also built a principled data-sandboxing verifier based on range analysis.  ...  With range analysis, the optimizer can tell that the second check can be removed because the range of ecx is already in the data region before the check. Loop check hoisting.  ... 
doi:10.1145/2046707.2046713 dblp:conf/ccs/ZengTM11 fatcat:ko7e67uyg5eznkclpbx5hobyue
« Previous Showing results 1 — 15 out of 1,350,259 results