English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In BUNDLE: Real-Time Multi-Threaded Scheduling to Reduce Cache Contention,Tessler and Fisher propose a scheduling mechanism and combined worst-caseexecution time calculation method that treats the instruction cache as abeneficial resource shared between threads. Object analysis produces aworst-case execution time bound and separates code segments into regions.Threads are dynamically placed in bundles as- sociated with regions at run timeby the BUNDLE scheduling algorithm where they benefit from shared cache values.  In the evaluation of the previous work, tasks were created with apredetermined worst-case execution time path through the control flow graph.Apriori knowledge of the worst-case path is an impractical restriction on anyanalysis. At the time, the only other solution available was an all-pathssearch of the graph, which is an equally impractical approach due to itscomplexity.  The primary focus of this work is to build upon BUNDLE, expanding itsapplicability beyond a proof of concept. We present a complete a worst-caseexecution time calculation method that includes thread level context switchcosts, operating on real programs, with representative architecture parameters,and compare our results to those produced by Heptane's state of the art method.To these ends, we propose a modification to the BUNDLE scheduling algorithmcalled BUNDLEP. Bundles are assigned priorities that enforce an ordered flow ofthreads through the control flow graph -- avoiding the need for multipleall-paths searches through the graph. In many cases, our evaluation shows arun-time and analytical benefit for BUNLDEP compared to serialized threadexecution and state of the art WCET analysis.

BUNDLEP: Prioritizing Conflict Free Regions in Multi-Threaded Programs to Improve Cache Reuse -- Extended Results and Technical Report