Large Problems, Small Machines
Home > Computing and Information Technology > Computer programming / software engineering > Software Engineering > Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms
Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms

Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms describes a practical, real-world approach to program optimization based on advanced algorithms. Topics covered range from how to save storage using a restricted character set and how to speed up access to records by employing hash coding (or "scatter storage") and caching. A selective mailing list system is used to illustrate rapid access to and rearrangement of information selected by criteria specified at run-time. Comprised of six chapters, this book begins by discussing factors to consider when deciding whether a program needs optimization. In the next chapter, a supermarket price lookup system is used to illustrate how to save storage by using a restricted character set and how to speed up access to records with the aid of hash coding and caching. Attention is paid to rapid retrieval of prices. A selective mailing list system is then used to illustrate rapid access to and rearrangement of information selected by criteria specified at run-time. The book also considers the Huffman coding and arithmetic coding methods of data compression before concluding with a review of the characteristics of the algorithms encountered in previous chapters, as well as the future of the art of optimization. This monograph will be a useful resource for practicing computer programmers and those who intend to be working programmers.

Table of Contents:
?Figures Foreword Preface Chapter 1: Let's Cet Small (and Fast): Introduction to Optimization Deciding Whether to Optimize Why Optimization Is Necessary Why Optimization Is Often Neglected Considering a Hardware Solution Categories of Optimization Finding the Critical Resource Determining How Much Optimization Is Needed A Real-Life Example Summary Radtesth: Include File for Radix40 Routines Radix40.h: Include File for Radix40 Routines Ascrad1.c: Radix40 Test Program #1 Ascrad2.c: Radix40 Test Program #2 Ascrad3.c: Radix40 Test Program #3 Ascrad4.c: Radix40 Test Program #4 Radasc.c: Radix40 to Ascii Conversion Chapter 2: Hash, Cache, and Crunch: A Supermarket Price Lookup System Introduction A Possible Solution Some Random Musings Starting at the Beginning Divide and Conquer Unite and Rule Knowing When to Stop Handling Subfile Overflow Some Drawbacks of Hashing The Only Good Disk Access Heading for The Final Lookup Saving Storage The Code Some User-Defined Types Preparing to Access The Price File Making a Hash of Things Searching the File Wrapping Around at End-of-File Summary Problems Program Listings Superm.h: Supermarket Pricing Include File Superm.c: Supermarket Pricing Main Program Suplook.c: Supermarket Pricing Lookup Routines Bcdconv.h: BCD Conversion Include File Bcdconv.c: Conversions to/from BCD Radix40.c: Conversions to/from Radix40 Representation Stestgen.c: Generates Test Code File Supinit.c: Supermarket Pricing File Initialization Supert.c: Supermarket Pricing Main Program Chapter 3: Strips, Bits, and Sorts: A Mailing List System Introduction A First Approach Starting the Optimization Saving Storage with Bitmaps Increasing Processing Speed The Law of Diminishing Returns Strip Mining Sorting Speed The Distribution Counting Sort Multi-Character Sorting On the Home Stretch The Code Determining the Proper Buffer Size Preparing to Read the Key File Reading the Key File Setting a Bit in a Bitmap Allocate as You Go Getting Ready to Sort The Megasort Routine Finishing Up Performance Summary Problems Program Listings Mailx.h: Mailing List Include File Mailx.c: Mailing List Program Mail.h: Mailing List Include File Maily.c: Mailing List Program Mail.c: Mailing List Program Megac.c: Distribution Sorting Program Sorttest.c: Test Sorting Program Bitfunc.h: Bitmap Header File Bitfunc.c: Bitmap Functions Chapter 4: Cn U Rd Ths Okly? A Data Compression Utility Introduction Huffman Coding Half a Bit Is Better Than One Getting a Bit Excited A Character Study Keeping It in Context Conspicuous Non-Consumption Receiving the Message The Code A Loose Translation Getting in on the Ground Floor Gentlemen, Start Your Output The Main Loop Encode_Symbol Update_Model Finding the Bottlenecks Dead Slow Ahead Getting the Correct Answer, Slowly Some Assembly is Required Memories Are Made of This Loop, De-Loop Odd Man Out Getting There Is Half the Fun A Bunch of Real Characters Summary Problems Program Listings Arith.h: Arithmetic Coding Constants Model.h: Translation Table Coding Constants and Variables Encode.c: Encoding Main Module Encodel.c: Encoding Main Module Adapt.c: Adaptive Modeling Routines Arenc.c: Arithmetic Encoding Routines Longasm.c: Comparison of C and Assembly in Long Arithmetic Arenc1.c: Arithmetic Encoding Routines, with Assembly Arenc2.c: Arithmetic Encoding Routines, with Assembly Decode.c: Decoding Main Module Decode1.c: Decoding Main Module Ardec.c: Arithmetic Decoding Routines Chapter 5: Free at Last: A Customer Database Program with Variable Length Records Introduction A Harmless Fixation Checking Out of the Hotel Procrustes The Quantum File Access Method A Large Array Many Large Arrays The Light at the End of the Tunnel The Quantum File Header Record The Itinerary Let's Get Physical Get_Quantum Find_Buffer Reading, Writing, and A Logical Analysis qf_Open_Quantum_File qf_Create_Main_Object Reserve_Available_Quantum Initialize_Big_Pointer_Array qf_Store_Item and qf_Get_Item Add_Item_to_Quantum Delete_Item_in_Quantum qf_Close_Quantum_File Get_Pointer_to_Item The Grab Bag Taking it from the Top Initialize_Quantum_File Edit_Customer_Records Summary Problems Program Listings Custdata.h: Customer Data Base Include File Custdata.c: Customer Database Program Xmemd.h: Include File to Provide Dummy Extended Memory Allocation Routines Quantum.h: Quantum File Header Quantum.c: Quantum File Functions Chapter 6: Mozart, No; Would You Believe Gershwin? Introduction Summary of Characteristics Some Thoughts on the Future Why Johnny Can't Estimate Goodbye for Now Suggested Approaches to Problems Ordering Instructions Index


Best Sellers


Product Details
  • ISBN-13: 9780123390905
  • Binding: Hardback
  • No of Pages: 272
  • Weight: 710 gr
  • ISBN-10: 0123390907
  • Language: English
  • Sub Title: Transforming Your Programs with Advanced Algorithms


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms
-
Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Large Problems, Small Machines: Transforming Your Programs with Advanced Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!