Blunder Dome Sighting  
privacy 
 
 
 

Hangout for experimental confirmation and demonstration of software, computing, and networking. The exercises don't always work out. The professor is a bumbler and the laboratory assistant is a skanky dufus.



Click for Blog Feed
Blog Feed

Recent Items
 
Smartcard Trustworthiness
 
Emulating Obsolete Document Formats
 
If Metadata Is the Answer, What Is the Question?
 
Identifying the Objective, not its Location
 
Criteria for Web Application Security
 
Who Can You Trust?
 
Perfecting Secure Coding
 
The Future of Software Tools
 
It's You? Ping You're It!
 
Self-Publishing Boxed Sets

This page is powered by Blogger. Isn't yours?
  

Locations of visitors to this site
visits to Orcmid's Lair pages

The nfoCentrale Blog Conclave
 
Millennia Antica: The Kiln Sitter's Diary
 
nfoWorks: Pursuing Harmony
 
Numbering Peano
 
Orcmid's Lair
 
Orcmid's Live Hideout
 
Prof. von Clueless in the Blunder Dome
 
Spanner Wingnut's Muddleware Lab (experimental)

nfoCentrale Associated Sites
 
DMA: The Document Management Alliance
 
DMware: Document Management Interoperability Exchange
 
Millennia Antica Pottery
 
The Miser Project
 
nfoCentrale: the Anchor Site
 
nfoWare: Information Processing Technology
 
nfoWorks: Tools for Document Interoperability
 
NuovoDoc: Design for Document System Interoperability
 
ODMA Interoperability Exchange
 
Orcmid's Lair
 
TROST: Open-System Trustworthiness

2004-12-01

 

When to Optimize, When to Tune

ACM News Service: Think Like a Customer, Use Your Stopwatch.  2004-10-31: This is a highly-pragmatic and practical set of views, especially with regard to where to tune and when to find an algorithmic optimization. Geoff Koch's 2004-10-15 SD Times article carries a more-careful, progressive presentation of how tools are used and the sensibilities that are applied when searching for improved performance.  There are some interesting tips, including the importance of making sure that optimized code is not unmaintainable. Randy Camp of Musicmatch uses an approach that is interesting to me because he talks about focusing on the place where the greatest performance loss occurs.  Also, there is a reference implementation created to provide a framework for assessing improvements.  Since I am building a reference implementation for a project, it will be useful to consider how it could be used to optimize for a simple production version based on that design. The article has some fanciful ideas at the end, including having appropriate algorithms be automatically selected based on conditions at hand.  This is in fact something functional programming is set up to do, and I'll tuck that thought away too.

 
Construction Structure (Hard Hat Area) You are navigating Orcmid's Lair.

template created 2004-06-17-20:01 -0700 (pdt) by orcmid
$$Author: Orcmid $
$$Date: 10-04-30 22:33 $
$$Revision: 21 $