Improving Modern Programming Language Performance: A Memory-Conscious Approach. The performance of modern programming languages such as Java and C# lags that of imperative languages such as C and Fortran. A significant source of the performance gap is poor memory behavior, which future computer architectures will exacerbate. This project addresses the problem of poor memory behavior in modern programming languages such as Java and C# through an integrated attack that incorporates new garbage c ....Improving Modern Programming Language Performance: A Memory-Conscious Approach. The performance of modern programming languages such as Java and C# lags that of imperative languages such as C and Fortran. A significant source of the performance gap is poor memory behavior, which future computer architectures will exacerbate. This project addresses the problem of poor memory behavior in modern programming languages such as Java and C# through an integrated attack that incorporates new garbage collection algorithms, run-time techniques that optimize running programs, and new compiler analyses with both static and dynamic optimizations. The project will give Australia an
international presence in a research area of great academic and commercial importance.
Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less
Credential Systems and Their Applications in Securing Electronic Health Records. The expected result of this project will be frontier technologies that are essential in applications and services, whose acceptance and take-up will depend on users' assurance of their security in the cyber world. In particular, a service such as the EHR system, which is known to be a complex system, requires the use of new and innovative credential-based systems. The result will also contribute to maintaining Austr ....Credential Systems and Their Applications in Securing Electronic Health Records. The expected result of this project will be frontier technologies that are essential in applications and services, whose acceptance and take-up will depend on users' assurance of their security in the cyber world. In particular, a service such as the EHR system, which is known to be a complex system, requires the use of new and innovative credential-based systems. The result will also contribute to maintaining Australia's leading position in the telecommunication and information technology industries, which has been recognised by increased government funding levels. The resulting applications of this project will place Australia as the first country able to design and implement a secure EHR system.Read moreRead less