Multiple sub-row buffers in DRAM: unlocking performance and energy improvement opportunities

The twin demands of energy-efficiency and higher performance on DRAM are highly emphasized in multicore architectures. A variety of schemes have been proposed to address either the latency or the energy consumption of DRAMs. These schemes typically require non-trivial hardware changes and end up improving latency at the cost of energy or vice-versa. One specific DRAM performance problem in multicores is that interleaved accesses from different cores can potentially degrade row-buffer locality. In this paper, based on the temporal and spatial locality characteristics of memory accesses, we propose a reorganization of the existing single large row-buffer in a DRAM bank into multiple sub-row buffers (MSRB). This re-organization not only improves row hit rates, and hence the average memory latency, but also brings down the energy consumed by the DRAM. The first major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves weighted speedup by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. The proposed MSRB organization enables opportunities for the management of multiple row-buffers at the memory controller level. As the memory controller is aware of the behaviour of individual cores it allows us to implement coordinated buffer allocation schemes for different cores that take into account program behaviour. We demonstrate two such schemes, namely Fairness Oriented Allocation and Performance Oriented Allocation, which show the flexibility that memory controllers can now exploit in our MSRB organization to improve overall performance and/or fairness. Further, the MSRB organization enables additional opportunities for DRAM intra-bank parallelism and selective early precharging of the LRU row-buffer to further improve memory access latencies. These two optimizations together provide an additional 5.9% performance improvement.

A Perspective on Computer Assisted Assessment Techniques for Short Free-Text Answers

Computer Assisted Assessment (CAA) has been existing for several years now. While some forms of CAA do not require sophisticated text understanding (e.g., multiple choice questions), there are also student answers that consist of free text and require analysis of text in the answer. Research towards the latter till date has concentrated on two main sub-tasks: (i) grading of essays, which is done mainly by checking the style, correctness of grammar, and coherence of the essay and (ii) assessment of short free-text answers. In this paper, we present a structured view of relevant research in automated assessment techniques for short free-text answers. We review papers spanning the last 15 years of research with emphasis on recent papers. Our main objectives are two folds. First we present the survey in a structured way by segregating information on dataset, problem formulation, techniques, and evaluation measures. Second we present a discussion on some of the potential future directions in this domain which we hope would be helpful for researchers.

The computer simulation of primate (Macaca mulatta) spatial visual delayed response and cerebral prefrontal control function

Cerebral prefrontal function is one of the important aspects in neurobiology. Based on the experimental results of neuroanatomy, neurophysiology, behavioral sciences, and the principles of cybernetics and information theory after constructed a simple model simulating prefrontal control function, this paper simulated the behavior of Macaca mulatta completing delayed tasks both before and after its cerebral prefrontal cortex being damaged. The results indicated that there is an obvious difference in the capacity of completing delayed response tasks for the normal monkeys and those of prefrontal cortex cut away. The results are agreement with experiments. The authors suggest that the factors of affecting complete delayed response tasks might be in information keeping and extracting of memory including information storing, keeping and extracting procedures rather than in information storing process.

基于文件规范描述的文件模糊测试

针对传统文件测试效率不高、存在功能遗漏的缺点,提出一种基于文件规范描述的文件模糊测试方法。给出基于文件规范的文件推导规则,用于描述文件中结构的组织形式、结构与结构之间的依赖关系,生成同一格式下不同类型的文件并对每类文件进行模糊测试。实验结果表明,该方法能有效找到文件处理软件的脆弱点。

Structure and Interpretation of Computer Programs

"The Structure and Interpretation of Computer Programs" is the entry-level subject in Computer Science at the Massachusetts Institute of Technology. It is required of all students at MIT who major in Electrical Engineering or in Computer Science, as one fourth of the "common core curriculum," which also includes two subjects on circuits and linear systems and a subject on the design of digital systems. We have been involved in the development of this subject since 1978, and we have taught this material in its present form since the fall of 1980 to approximately 600 students each year. Most of these students have had little or no prior formal training in computation, although most have played with computers a bit and a few have had extensive programming or hardware design experience. Our design of this introductory Computer Science subject reflects two major concerns. First we want to establish the idea that a computer language is not just a way of getting a computer to perform operations, but rather that it is a novel formal medium for expressing ideas about methodology. Thus, programs must be written for people to read, and only incidentally for machines to execute. Secondly, we believe that the essential material to be addressed by a subject at this level, is not the syntax of particular programming language constructs, nor clever algorithms for computing particular functions of efficiently, not even the mathematical analysis of algorithms and the foundations of computing, but rather the techniques used to control the intellectual complexity of large software systems.

Computer-Based Diagnostic Systems: Computer-Based Troubleshooting

ISBN: 3-540-76198-5 (out of print)

Homology Induction: the use of machine learning to improve sequence similarity searches

Karwath, A. King, R. Homology induction: the use of machine learning to improve sequence similarity searches. BMC Bioinformatics. 23rd April 2002. 3:11 Additional File Describes the title organims species declaration in one string [http://www.biomedcentral.com/content/supplementary/1471- 2105-3-11-S1.doc] Sponsorship: Andreas Karwath and Ross D. King were supported by the EPSRC grant GR/L62849.

Thinking with and outside the box: developing computer support for evidence teaching

B. Schafer, J. Keppens and Q. Shen. Thinking with and outside the Box: Developing Computer Support for Evidence Teaching. P. Robert and M. Redmayne (Eds.), Innovations in Evidence and Proof: Integrating Theory, Research and Teaching, pp. 139-158, 2007.

Overhauling the PDB

Schierz, A.C., L. Soldatova, R.D. King. Overhauling the PDB. Nature Biotechnology, 25, No. 4, April 2007, pp 437 - 442. Sponsorship: Project IQ, EU IST-FET FP6-516169 BBSRC Project 2/BEP17028

Computer technology in detection and staging of prostate carcinoma: a review

Y. Zhu, S. Williams and R. Zwiggelaar, 'Computer technology in detection and staging of prostate carcinoma: a review', Medical Image Analysis 10 (2), 178-199 (2006)

The detection of 'soft' materials by selective energy xray transmission imaging and computer tomography

R. Zwiggelaar, C.R. Bull, M.J. Mooney and S. Czarnes, 'The detection of 'soft' materials by selective energy xray transmission imaging and computer tomography', Journal of Agricultural Engineering Research 66 (3), 203-212 (1997)