Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

Graph-Based Procedural Abstraction - Paperback

$76.21 USD
$76.21 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fastest Delivery Tomorrow With Vip DealOrder within 1 hr 8 mins.

Instant 10% Discount On HDFC Banks Credit/Debit Cards EMI and CreditCard

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa
  • Daily deals
  • Return policy
  • Payment method
  • Help center 24/7

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
Graph-Based Procedural Abstraction - Paperback
Graph-Based Procedural Abstraction - Paperback
Graph-Based Procedural Abstraction - Paperback
$76.21/ea
$0.00
$76.21/ea $0.00

Product Description

by Alexander Dreweke (Author)

Goal of this book was it to create program code for embedded systems as compact as possible, because memory is one of the limiting factors on theses systems. As there are often various procedures with the same or very similar code fragments, compilers do not generate optimal code in terms of code size. Most of these fragments only differ in the ordering of the instructions or the used registers. These fragments can be abstracted into own procedures which afterwards get called. Because modern compilers only optimize a procedure or a module at the time, they lack the information to do these optimizations. Some optimizations evolve only after the final register allocation and the linking of all modules and libraries. Because of this we apply procedural abstraction in this book to statically linked binaries. An search for common code not only in code sequences but among data flow graphs. This way we where able to save twice as much instructions on average.

Number of Pages: 72
Dimensions: 0.15 x 9 x 6 IN
Publication Date: March 25, 2008
you might like