skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Repeatability and Benefaction in Computer Systems Research


No abstract provided.

  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Publication Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Technical Report
Country of Publication:
United States

Citation Formats

Tsai, Karen Chung-Yen. Repeatability and Benefaction in Computer Systems Research. United States: N. p., 2017. Web. doi:10.2172/1371683.
Tsai, Karen Chung-Yen. Repeatability and Benefaction in Computer Systems Research. United States. doi:10.2172/1371683.
Tsai, Karen Chung-Yen. 2017. "Repeatability and Benefaction in Computer Systems Research". United States. doi:10.2172/1371683.
title = {Repeatability and Benefaction in Computer Systems Research},
author = {Tsai, Karen Chung-Yen},
abstractNote = {No abstract provided.},
doi = {10.2172/1371683},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2017,
month = 7

Technical Report:

Save / Share:
  • The progress report is divided into three sections, numerical methods (including error estimation and global error theory, error estimation and control, equivalence of multistep formulas, optimal A(O)-stable linear multistep formulas, stability regions for formulas for second-order equations, numerical simulation system, blended methods, and block implicit methods), software and related work (including PLW, GIML, and IIS, GRASS, MAP, UNIX, communications programs, and raster display systems), and publications. Projects already documented in reports or publications are merely summarized, while current projects are treated in greater detail. 5 figures, 5 tables. (RWR)
  • The overall goal of the Yale Computer Science Department's Attached Processor Project systems group is to improve dramatically the practical state of the art in CPU-bound scientific computing. Specifically, we are building a very long (probably over 500 bits) instruction word machine, the ELI-512. A machine with this much irregular parallelism can reasonably be coded only in high-level languages; this requires state-of-the-art techniques in compiling horizontal microcode. An effective approach to this problem, trace scheduling, has been developed at Yale over the past three years. Longword instruction machines are now quite popular and may offer the best alternative for obtainingmore » supercomputer power at a fraction of its current cost. Unfortunately, they are already being built too wide for people or today's compilers to generate significant quantities of good code for them. Without this or similar work, there is little chance that more usable wide-word architectures will be commercially developed. It is an aim of this project to cause such commercial development to occur. The following are key steps in building the ELI-512: (1) Parallelism measurements, (2) Compiling for existing machines, (3) Compiling for, designing, and building the highly parallel ELI-512, (4) Allowing the compiler to design highly parallel customized procesors.« less
  • Research areas in mathematics and computer science for high-performance computer systems are described. The following five areas warrant further investigation: algorithm analysis for new computer architectures, architecture evaluation of advanced computer systems, high-level optimization of advanced computer systems, scientific application of high-performance computer systems, and systems analysis for high-performance computer systems. (RWR)