Titlebook: Languages, Compilers, and Tools for Embedded Systems; ACM SIGPLAN Workshop Frank Mueller,Azer Bestavros Conference proceedings 1998 The Edi

添加劑

書目名稱Languages, Compilers, and Tools for Embedded Systems影響因子(影響力)




書目名稱Languages, Compilers, and Tools for Embedded Systems影響因子(影響力)學(xué)科排名




書目名稱Languages, Compilers, and Tools for Embedded Systems網(wǎng)絡(luò)公開度




書目名稱Languages, Compilers, and Tools for Embedded Systems網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Languages, Compilers, and Tools for Embedded Systems被引頻次




書目名稱Languages, Compilers, and Tools for Embedded Systems被引頻次學(xué)科排名




書目名稱Languages, Compilers, and Tools for Embedded Systems年度引用




書目名稱Languages, Compilers, and Tools for Embedded Systems年度引用學(xué)科排名




書目名稱Languages, Compilers, and Tools for Embedded Systems讀者反饋




書目名稱Languages, Compilers, and Tools for Embedded Systems讀者反饋學(xué)科排名

實(shí)現(xiàn)

Languages, Compilers, and Tools for Embedded Systems978-3-540-49673-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

先兆

https://doi.org/10.1007/BFb0057775Debugging; Java; Linux; Pascal; Unified Modeling Language (UML); compiler; operating system; optimization; t

Rinne-Test

Eulogy

Ibd810

FACT

最低點(diǎn)

Automatic accurate time-bound analysis for high-level languages,ons to make the overall analysis efficient as well as accurate, and measurements of primitive parameters, all at the source-language level. We have implemented this approach and performed a number of experiments for analyzing Scheme programs. The measured worst-case times are closely bounded by the calculated bounds.

調(diào)味品

Cache sensitive pre-runtime scheduling, statically determined by abstract interpretation. For the sake of efficiency, the scheduling algorithm uses a heuristically guided search strategy. Each time a new task segment is added to a partial schedule, its worst case execution time is calculated based on the cache state at the end of the preceding partial schedule.

sigmoid-colon

An efficient data partitioning method for limited memory embedded systems,ctor. We then develop a methodology based on 0/1 knapsack algorithm to partition the references in local/remote memory. We show the performance improvements due to our approach and compare the results.