ST-CRTS: Collaborative Research: Algorithmic Optimizations in Dynamic Programming Environments

根据摩尔定律，计算机性能的快速提高使软件架构师能够设计出功能和复杂性不断增加的软件。因此，消费者期望软件在功能上不断增长，并且可以在每个新版本中处理更大的数据集（例如，巨大的电子表格或流媒体高质量视频）。不幸的是，由于物理限制，如线路延迟和散热，摩尔定律在不久的将来可能不会成立，硬件的速度将无法满足软件的需求。因此，为了满足新软件的性能要求，必须考虑软件技术。提出的工作将探索一种新的方法，算法优化虚拟机，为下一代软件提供性能。智力价值——一种对算法、数据结构及其应用的实现进行标记的系统。了解该系统的VM可以利用该信息将用户与合适的实现连接起来。一个不知道这个系统的虚拟机仍然可以正确地执行代码，但没有性能上的好处。一个Java虚拟机的实现，利用这些信息来提高性能。这种实现支持包括对垃圾收集器（用于将数据从一种表示迁移到另一种表示）、编译器（用于内联调用）和调度器（用于调度优先级较低的配置文件收集线程）的修改。-标记为利用算法优化的库和应用程序的集合。这将构成对拟议工作的评价的一部分。更广泛的影响作为本研究的一部分开发的基础设施将用于本科算法课程，使学生深入了解常用算法和数据结构的优势和局限性。该研究将为满足未来软件系统的需求提供必要的性能。

BackgroundRapid increases in computer performance, according to Moores law, have enabled software architects todesign software of ever increasing functionality and complexity. Consequently, consumers expect softwarethat grows in functionality and can process larger data sets with every new release (e.g., huge spreadsheetsor streaming high-quality video). Unfortunately, since Moores law will likely not hold in the near future,owing to physical limitations such as wire delays and heat dissipation, hardware speedups will not keeppace with the demands of software. Thus, to meet the performance requirements of new software, one mustlook to software techniques. The proposed work will explore a new approach, algorithmic optimizations invirtual machines, to provide the performance for next generations of software.Intellectual Merit-A system for marking implementations of algorithms, data structures, and their uses. A VM thatknows about this system can exploit the information for connecting uses with suitable implementations.A VM that does not know about this system still executes the code correctly but without itsperformance benefits.-An implementation within a Java virtual machine that exploits the information for improving performance.This implementation support includes modifications to the garbage collector (for migratingdata from one representation to another), compiler (for inlining away the calls), and scheduler (forscheduling profile collection threads with lower priority).-A collection of libraries and applications marked to exploit algorithmic optimizations. This will formpart of the evaluation for the proposed work.Broader ImpactThe infrastructure developed as part of this research will be used in undergraduatealgorithms classes to give students deep knowledge about the strengths and limitations of commonly used algorithms and data structures. This research will provides the performance necessary for meeting the needs of future software systems.