Results 1 - 10 of 270

Highly Accurate Data Value Prediction using Hybrid Predictors

by Kai Wang, Manoj Franklin , 1997
"... Data dependences (data flow constraints) present a major hurdle to the amount of instruction-level parallelism that can be exploited from a program. Recent work has suggested that the limits imposed by data dependences can be overcome to some extent with the use of data value prediction. That is, wh ..."
Abstract - Cited by 211 (3 self) - Add to MetaCart
benchmarks, we combine these two predictors to form a hybrid predictor. Simulation analysis of the hybrid predictor shows its overall prediction accuracy to be better than that of the component predictors across all benchmarks.

STAMP: Stanford Transactional Applications for Multi-Processing

by Chí Cao Minh, Jaewoong Chung, Christos Kozyrakis, Kunle Olukotun
"... Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature, we are still missing the tools and workloads necessary to analyze and compare the proposals. Most TM systems have been ev ..."
Abstract - Cited by 206 (9 self) - Add to MetaCart
Abstract—Transactional Memory (TM) is emerging as a promising technology to simplify parallel programming. While several TM systems have been proposed in the research literature, we are still missing the tools and workloads necessary to analyze and compare the proposals. Most TM systems have been

Performance of Hybrid Message-Passing and Shared-Memory Parallelism for Discrete Element Modeling

by D. S. Henty - in Proc. Supercomputing’00 , 2000
"... The current trend in HPC hardware is towards clusters of shared-memory (SMP) compute nodes. For applications developers the major question is how best to program these SMP clusters. To address this we study an algorithm from Discrete Element Modeling, parallelised using both the message-passing and ..."
Abstract - Cited by 64 (1 self) - Add to MetaCart
will be beneficial on SMP clusters. We benchmarkMPI and OpenMP implementations of the algorithm on MPP, SMP and cluster architectures, and evaluate the effectiveness of hybrid parallelism. Although we observe cases where OpenMP is more efficient than MPI on a single SMP node, we conclude that our current Open

Parallel Distributed Approaches to Combinatorial Optimization -- Benchmark Studies on Traveling Salesman Problem

by Carsten Peterson , 1990
"... We present and summarize the results from 50-, 100- and 200-city TSP benchmarks presented at the 1989 NIPS post-conference workshop using neural network, elastic net, genetic algorithm and simulated annealing approaches. These results are also compared with a state-of-the-art hybrid approach consist ..."
Abstract - Cited by 40 (8 self) - Add to MetaCart
We present and summarize the results from 50-, 100- and 200-city TSP benchmarks presented at the 1989 NIPS post-conference workshop using neural network, elastic net, genetic algorithm and simulated annealing approaches. These results are also compared with a state-of-the-art hybrid approach

Hybrid Parallel Programming with MPI and Unified Parallel C ∗

by James Dinan, Pavan Balaji, Rajeev Thakur, Ewing Lusk
"... The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited by the amountoflocalmemorywithinacomputenode. PartitionedGlobal Address Space (PGAS) models such as Unified Parallel C (U ..."
Abstract - Cited by 16 (3 self) - Add to MetaCart
(UPC) aregrowinginpopularitybecauseoftheirabilitytoprovideashared global address space that spans the memories of multiple compute nodes. However, taking advantage of UPC can require a large recoding effort for existingparallel applications. In this paper, we explore a new hybrid parallel programming

MPI versus MPI+OpenMP on the IBM SP for the NAS Benchmarks

by Franck Cappello, Daniel Etiemble , 2000
"... The hybrid memory model of clusters of multiprocessors raises two issues: programming model and performance. Many parallel programs have been written by using the MPI standard. To evaluate the pertinence of hybrid models for existing MPI codes, we compare a unified model (MPI) and a hybrid one (Open ..."
Abstract - Cited by 48 (0 self) - Add to MetaCart
The hybrid memory model of clusters of multiprocessors raises two issues: programming model and performance. Many parallel programs have been written by using the MPI standard. To evaluate the pertinence of hybrid models for existing MPI codes, we compare a unified model (MPI) and a hybrid one

Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork

by Xavier Boyen , Brent Waters - CRYPTO 2006. LNCS, , 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract - Cited by 119 (10 self) - Add to MetaCart
to which other schemes fell prey. This idea gives us provable anonymity, even under symmetric pairings. Second, we use multiple parallel HIBE systems and constantly re-randomize the keys between them. This is what lets us use the linear splitting trick at all levels of the hierarchy, but also poses a

Benchmarks Many

by unknown authors
"... molecular biology techniques require purification of cDNAs, DNAs, or DNA-RNA hybrids, and/or fractionation of nucleic acids from various biological sources and reactions to improve downstream performance. Generally, PCR amplicons with short primers (~20 bp) and no artifacts can be readily purified w ..."
Abstract - Add to MetaCart
molecular biology techniques require purification of cDNAs, DNAs, or DNA-RNA hybrids, and/or fractionation of nucleic acids from various biological sources and reactions to improve downstream performance. Generally, PCR amplicons with short primers (~20 bp) and no artifacts can be readily purified

HyPer: A hybrid OLTP&OLAP Main Memory Database System based on Virtual Memory Snapshots

by Alfons Kemper, Thomas Neumann, Fakultät Für Informatik, Technische Universität München, D- Garching - In ICDE , 2011
"... Abstract—The two areas of online transaction processing (OLTP) and online analytical processing (OLAP) present different challenges for database architectures. Currently, customers with high rates of mission-critical transactions have split their data into two separate systems, one database for OLTP ..."
Abstract - Cited by 82 (29 self) - Add to MetaCart
at the same time: unprecedentedly high transaction rates as high as 100000 per second and very fast OLAP query response times on a single system executing both workloads in parallel. The performance analysis is based on a combined TPC-C and TPC-H benchmark. I.

Benchmarking hybrid OLTP & OLAP database systems

by Florian Funke, Alfons Kemper, Thomas Neumann - In BTW , 2011
"... Abstract: Recently, the case has been made for operational or real-time Business Intelligence (BI). As the traditional separation into OLTP database and OLAP data warehouse obviously incurs severe latency disadvantages for operational BI, hybrid OLTP&OLAP database systems are being developed. Th ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. The advent of the first gener-ation of such hybrid OLTP&OLAP database systems requires means to characterize their performance. While there are standardized and widely used benchmarks addressing either OLTP or OLAP workloads, the lack of a hybrid benchmark led us to the definition of a new mixed workload
Results 1 - 10 of 270