Exploiting Task-Order Information

Exploiting Task-Order Information


Marketed By :  Südwestdeutscher Verlag für Hochschulschriften   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 6,631

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

Over the last years, researchers and engineers have developed numerous abstractions and programming models that make developing parallel programs easier, safer, and more efficient. Despite the advances made in parallel programming, however, the corresponding compilers still remain largely ignorant of the parallelism exhibited by the program execution. In particular, current compilers do not have any knowledge about what tasks are scheduled with what ordering---even though many higher-level parallel programming models contain a wealth of task-order information that can be exploited by the compiler. This thesis presents a schedule analysis that can extract task-ordering information from real-world programs. By analyzing potential orderings between tasks, the compiler can decide whether accesses to shared memory by different tasks may interfere and use this information to guide its optimization efforts. The schedule analysis can be combined with standard program analyses such as points-to and escape analysis to improve the precision of known optimizations as well as enable new optimizations.

Product Specifications
SKU :COC18072
Country of ManufactureIndia
Product BrandSüdwestdeutscher Verlag für Hochschulschriften
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-27
0 Review(s)