Realistic Uncheatable Benchmarks
Realistic Uncheatable Benchmarks
批准号:
9634665
负责人:
Jin-Yi Cai
金额:
$24.22万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1996
资助国家:
美国
项目状态:
已结题
起止时间:
1996-09-01 至 2000-08-31
中文摘要
基于计算复杂性理论,设计现实不可欺骗基准的项目努力实现更复杂的计算机性能基准设计方法。目标是将随机化和密码学的思想与日常使用中现实的现有基准相结合。近年来,理论计算机科学取得了巨大的进步,特别是在随机化和相互作用方面。这些想法非常适合设计不可欺骗的基准。基准测试的目的是评估硬件和软件系统的性能和可靠性。总的来说,现有的基准设计主要集中在系统的“典型”程序和数据集上。使基准不受篡改的问题大多被忽视了。该项目正在进行的研究已经证明了将计算复杂性和密码学的思想应用于各种现有基准的可行性,并使它们更准确,更抗篡改,从而更值得信赖
英文摘要
The project on the design of realistic uncheatable benchmarks strives to achieve a more sophisticated design methodology of computer performance benchmarks, based on the theory of computational complexity. The goal is to integrate ideas from randomization and cryptography with realistic existing benchmark in everyday use. There has been tremendous progress in theoretical computer science in recent years, especially with regard to the power of randomization and interaction. These ideas are well suited to the design of uncheatable benchmarks. The purpose of benchmark testing is to estimate the performance and reliability of hardware and software systems. By and large existing benchmark design has focused on "typical" programs and data sets for the system. The problem of making benchmarks resistant to tampering has been mostly ignored. The on-going research in this project has demonstrated the feasibility of applying ideas from computational complexity and cryptography to a wide variety of existing benchmarks, and making them more accurate, resistant to tampering and thus more trustworthy.***
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Classification Program for Counting Problems
-
批准号:1714275
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2017
-
负责人:Jin-Yi Cai
-
依托单位:
AF: Small: Counting Problems, Holographic Algorithms and Dichotomy Theorems
-
批准号:1217549
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2012
-
负责人:Jin-Yi Cai
-
依托单位:
Counting Problems and Dichotomy Theorems
-
批准号:0914969
-
项目类别:Standard Grant
-
资助金额:$39.73万
-
财政年份:2009
-
负责人:Jin-Yi Cai
-
依托单位:
Holographic Algorithms and Reductions
-
批准号:0830488
-
项目类别:Standard Grant
-
资助金额:$10.0万
-
财政年份:2008
-
负责人:Jin-Yi Cai
-
依托单位:
Some Problems in Complexity Theory
-
批准号:0511679
-
项目类别:Continuing Grant
-
资助金额:$20.0万
-
财政年份:2005
-
负责人:Jin-Yi Cai
-
依托单位:
Some Problems in Structural and Lattice Complexity
-
批准号:0208013
-
项目类别:Standard Grant
-
资助金额:$29.41万
-
财政年份:2002
-
负责人:Jin-Yi Cai
-
依托单位:
Worst-Case v.s. Average-Case Complexity and Applications to Secure Cryptography
-
批准号:0196197
-
项目类别:Standard Grant
-
资助金额:$22.0万
-
财政年份:2000
-
负责人:Jin-Yi Cai
-
依托单位:
Worst-Case v.s. Average-Case Complexity and Applications to Secure Cryptography
-
批准号:9820806
-
项目类别:Standard Grant
-
资助金额:$22.0万
-
财政年份:1999
-
负责人:Jin-Yi Cai
-
依托单位:
Uncheatable Benchmarks
-
批准号:9319393
-
项目类别:Continuing Grant
-
资助金额:$13.42万
-
财政年份:1993
-
负责人:Jin-Yi Cai
-
依托单位:
PYI: A Study of Computational Complexity Theory
-
批准号:9496107
-
项目类别:Continuing Grant
-
资助金额:$9.44万
-
财政年份:1993
-
负责人:Jin-Yi Cai
-
依托单位:
PYI: A Study of Computational Complexity Theory
-
批准号:9057486
-
项目类别:Continuing Grant
-
资助金额:$14.4万
-
财政年份:1990
-
负责人:Jin-Yi Cai
-
依托单位:
海外基金