, as well as novel abstractions like Active Message can be implemented efficiently. A U-Net prototype on an 8-node ATM cluster of standard workstations achieves 15Mbytes/s TCP bandwidth with 1Kbyte buffers and demonstrates performance equivalent to Meiko CS-2 and TMC CM-5 supercomputers on a set of Split-C

. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers -- the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows

Capo benchmarks, a set of open source, client-side Java benchmarks. We demonstrate that the complex interactions of (1) architecture, (2) compiler, (3) virtual machine, (4) memory management, and (5) application require more extensive evaluation than C, C++, and Fortran which stress (4) much less, and do

researchers have been concerned with the evaluation and performance of optimization codes. As recent examples, we cite [1, 2, 3, 4, 6, 12, 17]. The interpretation and analysis of the data generated by the benchmarking process are the main technical issues addressed in this paper. Most benchmarking efforts

rates, r 10 t . To capture potential non-linear effects due to convexity, we also include the squared level of the term structure, (r 10 t ) 2 . Slope of Yield Curve We define the slope of the yield curve as the difference between Datastream's 10-year and 2-year Benchmark Treasury yields, slope

) sharing sensation, (2) sharing episodes, and (3) sharing learned policies. This paper shows that (a) additional sensation from another agent is beneficial if it can be used efficiently, (b) sharing learned policies or episodes among agents speeds up learning at the cost of communication, and (c) for joint

. It runs on the Connection Machine CM-2, the Cray Y-MP C90, and serial machines. We compare initial benchmark results of Nesl with those of machine-specific code on these machines for three algorithms: least-squares line-fitting, median finding, and a sparse-matrix vector product. These results show

expressions in a single pass without temporaries. In preliminary benchmark results, one compiler evaluates vector expressions at 95-99.5% efficiency of hand-coded C using this technique (for long vectors). The speed is 2-15 times that of a conventional C++ vector class. Introduction Passing an expression

is required. In this paper we show that current RDBMSs can be beaten by nearly two orders of magnitude in the OLTP market as well. The experimental evidence comes from comparing a new OLTP prototype, H-Store, which we have built at M.I.T. to a popular RDBMS on the standard transactional benchmark, TPC-C. We

to protein coding-invariant regions of Basic Local Alignment Search Tool (BLAST)-aligned orthologs from human, fly, and roundworm with complete degeneracy added (typically ≤256-fold) wherever synonymous changes might occur (Regier, Cunningham, Ganley, Shi, and Ball, unpublished data). Since before 1995 (2