IPPS 2010 - PDF Preprint Papers

IPPS 2010 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-2010 Paper

click to vote

IPPS
2010
IEEE

345views Distributed And Parallel Com...» more IPPS 2010»

BlobSeer: Bringing high throughput under heavy concurrency to Hadoop Map-Reduce applications

13 years 9 months ago

Download hal.inria.fr

Hadoop is a software framework supporting the Map/Reduce programming model. It relies on the Hadoop Distributed File System (HDFS) as its primary storage system. The efficiency of ...

Bogdan Nicolae, Diana Moise, Gabriel Antoniu, Luc ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	345	BlobSeer: Bringing high throughput under heavy concurrency to Hadoop Map-Reduce applications	claim
2	335	Improving MapReduce performance through data placement in heterogeneous Hadoop clusters	claim
3	277	DEBAR: A scalable high-performance de-duplication storage system for backup and archiving	claim
4	272	Adapting cache partitioning algorithms to pseudo-LRU replacement policies	claim
5	265	DynTile: Parametric tiled loop generation for parallel execution on multicore processors	claim
6	234	Dynamic load balancing on single- and multi-GPU systems	claim
7	232	Inter-block GPU communication via fast barrier synchronization	claim
8	215	Oversubscription on multicore processors	claim
9	214	Scalable multi-pipeline architecture for high performance multi-pattern string matching	claim
10	210	Efficient lists intersection by CPU-GPU cooperative computing	claim
11	209	Improving numerical reproducibility and stability in large-scale numerical simulations on GPUs	claim
12	206	Clustering JVMs with software transactional memory support	claim
13	204	Processor affinity and MPI performance on SMP-CMP clusters	claim
14	204	Acceleration of spiking neural networks in emerging multi-core and GPU architectures	claim
15	203	Tile QR factorization with parallel panel processing for multicore architectures	claim
16	195	Hardware implementation for scalable lookahead Regular Expression detection	claim
17	195	Speculative execution on multi-GPU systems	claim
18	195	A simple thermal model for multi-core processors and its application to slack allocation	claim
19	192	Efficient hardware support for the Partitioned Global Address Space	claim
20	188	Operating system resource management	claim
21	188	Servet: A benchmark suite for autotuning on multicore clusters	claim
22	186	Using the middle tier to understand cross-tier delay in a multi-tier application	claim
23	185	Parallel computing with CUDA	claim
24	182	Scalable parallel I/O alternatives for massively parallel partitioned solver systems	claim
25	180	pFANGS: Parallel high speed sequence mapping for Next Generation 454-roche Sequencing reads	claim
26	180	Fast Smith-Waterman hardware implementation	claim
27	180	J2EE instrumentation for software aging root cause application component determination with AspectJ	claim
28	180	Profitability-based power allocation for speculative multithreaded systems	claim
29	180	Hypergraph-based task-bundle scheduling towards efficiency and fairness in heterogeneous distributed systems	claim
30	178	Use of Peer-To-Peer technology in Internet access networks and its impacts	claim
31	178	On the parallelisation of MCMC by speculative chain execution	claim
32	178	Runtime checking of serializability in software transactional memory	claim
33	175	PreDatA - preparatory data analytics on peta-scale machines	claim
34	175	Consistency in hindsight: A fully decentralized STM algorithm	claim
35	174	Exploiting constraints to build a flexible and extensible data stream processing middleware	claim
36	174	BitTorrent and fountain codes: friends or foes?	claim
37	174	Improving application performance with hardware data structures	claim
38	174	Fine-grained QoS scheduling for PCM-based main memory systems	claim
39	173	A GPU-inspired soft processor for high-throughput acceleration	claim
40	172	Parallel external memory graph algorithms	claim
41	172	A lock-free, cache-efficient multi-core synchronization mechanism for line-rate network traffic monitoring	claim
42	171	Analyzing the trade-off between multiple memory controllers and memory channels on multi-core processor performance	claim
43	169	Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system	claim
44	169	On the parallelisation of MCMC-based image processing	claim
45	169	An auto-tuning framework for parallel multicore stencil computations	claim
46	168	A distributed diffusive heuristic for clustering a virtual P2P supercomputer	claim
47	167	Scalability analysis of embarassingly parallel applications on large clusters	claim
48	164	A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA	claim
49	164	On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms	claim
50	162	Enhancing adaptive middleware for quantum chemistry applications with a database framework	claim
51	162	Identifying ad-hoc synchronization for enhanced race detection	claim
52	162	Executing task graphs using work-stealing	claim
53	161	Stability of a localized and greedy routing algorithm	claim
54	161	The pilot approach to cluster programming in C	claim
55	161	Optimal loop unrolling for GPGPU programs	claim
56	157	Fisheye lens distortion correction on multicore and hardware accelerator platforms	claim
57	156	Collaborative execution environment for heterogeneous parallel systems	claim
58	156	Distributed advance network reservation with delay guarantees	claim
59	156	Prototype for a large-scale static timing analyzer running on an IBM Blue Gene	claim
60	155	Evaluating database-oriented replication schemes in Software Transactional Memory systems	claim
61	154	Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory	claim
62	153	Large-scale multi-dimensional document clustering on GPU clusters	claim
63	153	Structuring the execution of OpenMP applications for multicore architectures	claim
64	153	A low cost split-issue technique to improve performance of SMT clustered VLIW processors	claim
65	152	Performance improvements of real-time crowd simulations	claim
66	150	Parallel Task for parallelizing object-oriented desktop applications	claim
67	148	Parallelization of tau-leap coarse-grained Monte Carlo simulations on GPUs	claim
68	147	Large neighborhood local search optimization on graphics processing units	claim
69	147	A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems	claim
70	146	Distributed monitoring of conditional entropy for anomaly detection in streams	claim
71	146	Hybrid MPI/Pthreads parallelization of the RAxML phylogenetics code	claim
72	146	Implementation of the compression function for selected SHA-3 candidates on FPGA	claim
73	145	Massive streaming data analytics: A case study with clustering coefficients	claim
74	145	Supporting fault tolerance in a data-intensive computing middleware	claim
75	144	Ensuring deterministic concurrency through compilation	claim
76	144	Restructuring parallel loops to curb false sharing on multicore architectures	claim
77	144	Solving the advection PDE on the cell broadband engine	claim
78	144	Improving the performance of Uintah: A large-scale adaptive meshing computational framework	claim
79	144	Decentralized resource management for multi-core desktop grids	claim
80	143	Reducing grid energy consumption through choice of resource allocation method	claim
81	143	Performance modeling of heterogeneous systems	claim
82	143	A general algorithm for detecting faults under the comparison diagnosis model	claim
83	142	Dynamic Fractional Resource Scheduling for cluster platforms	claim
84	142	Offline library adaptation using automatically generated heuristics	claim
85	142	An introductory exascale feasibility study for FFTs and multigrid	claim
86	142	Exploiting inter-thread temporal locality for chip multithreading	claim
87	142	Analysis of durability in replicated distributed storage systems	claim
88	142	Robust resource allocation of DAGs in a heterogeneous multicore system	claim
89	140	Initial characterization of parallel NFS implementations	claim
90	139	Highly scalable parallel sorting	claim
91	138	Modeling and analyzing the effects of firewalls and NATs in P2P swarming systems	claim
92	138	Static macro data flow: Compiling global control into local control	claim
93	138	A configurable high-throughput linear sorter system	claim
94	138	Designing high-performance and resilient message passing on InfiniBand	claim
95	137	Handling errors in parallel programs based on happens before relations	claim
96	137	Measuring properties of molecular surfaces using ray casting	claim
97	136	Multicore-aware reuse distance analysis	claim
98	135	A PRAM-NUMA model of computation for addressing low-TLP workloads	claim
99	135	Detecting and using critical paths at runtime in message driven parallel programs	claim
100	135	Characterizing heterogeneous computing environments using singular value decomposition	claim
101	135	Overlapping computation and communication: Barrier algorithms and ConnectX-2 CORE-Direct capabilities	claim
102	135	Towards dynamic reconfigurable load-balancing for hybrid desktop platforms	claim
103	135	Midpoint routing algorithms for Delaunay triangulations	claim
104	135	MMT: Exploiting fine-grained parallelism in dynamic memory management	claim
105	135	Oblivious algorithms for multicores and network of processors	claim
106	134	Efficient floating-point logarithm unit for FPGAs	claim
107	134	Optimization of linked list prefix computations on multithreaded GPUs using CUDA	claim
108	133	A parallel Particle swarm optimization algorithm for option pricing	claim
109	133	OpenCL - An effective programming model for data parallel computations at the Cell Broadband Engine	claim
110	133	Robust control-theoretic thermal balancing for server clusters	claim
111	132	Pricing of cross-currency interest rate derivatives on Graphics Processing Units	claim
112	132	Broadcasting on large scale heterogeneous platforms under the bounded multi-port model	claim
113	130	Dynamically tuned push-relabel algorithm for the maximum flow problem on CPU-GPU-Hybrid platforms	claim
114	129	Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform	claim
115	129	Parallelizing a Black-Scholes solver based on finite elements and sparse grids	claim
116	126	Dynamic adaptation of DAGs with uncertain execution times in heterogeneous computing systems	claim
117	126	GPU-accelerated multi-scoring functions protein loop structure sampling	claim
118	126	Out-of-core distribution sort in the FG programming environment	claim
119	126	User level DB: a debugging API for user-level thread libraries	claim
120	126	QR factorization of tall and skinny matrices in a grid computing environment	claim
121	126	Attack-resistant frequency counting	claim
122	126	Parallelization of DQMC simulation for strongly correlated electron systems	claim
123	126	Improving the performance of hypervisor-based fault tolerance	claim
124	124	Parallel I/O performance: From events to ensembles	claim
125	123	Modeling bounds on migration overhead for a traveling thread architecture	claim
126	123	Efficient traffic simulation using the GCA model	claim
127	123	To upgrade or not to upgrade? Catamount vs. Cray Linux Environment	claim
128	122	Performance study of mapping irregular computations on GPUs	claim
129	122	Resource management of enterprise cloud systems using layered queuing and historical performance models	claim
130	122	Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance	claim
131	122	An efficient Associative Processor solution to an Air Traffic Control problem	claim
132	121	Fault-tolerance for PastryGrid middleware	claim
133	121	Optimizing MPI communication within large multicore nodes with kernel assistance	claim
134	120	Fast binding site mapping using GPUs and CUDA	claim
135	120	Efficient and scalable parallel reconstruction of sibling relationships from genetic data in wild populations	claim
136	119	Evolving hybrid time-shuffled behavior of agents	claim
137	119	Large-scale distributed storage for highly concurrent Mapreduce applications	claim
138	119	Heterogeneity in data-driven live streaming: Blessing or curse?	claim
139	119	High performance comparison-based sorting algorithm on many-core GPUs	claim
140	118	Optimizing and tuning the fast multipole method for state-of-the-art multicore architectures	claim
141	118	Dynamic fractional resource scheduling for HPC workloads	claim
142	118	Performance impact of resource contention in multicore systems	claim
143	117	Dense linear algebra solvers for multicore with GPU accelerators	claim
144	117	Meta-scheduling in advance using red-black trees in heterogeneous Grids	claim
145	117	Performance evaluation of concurrent collections on high-performance multicore computing systems	claim
146	116	SPSE: A flexible QoS-based service scheduling algorithm for service-oriented Grid	claim
147	116	Estimating operating conditions in a Peer-to-Peer Session Initiation Protocol overlay network	claim
148	115	Experimental responsiveness evaluation of decentralized service discovery	claim
149	115	Solving large sparse linear systems in a grid environment using Java	claim
150	113	An empirical study of a scalable Byzantine agreement algorithm	claim
151	113	TiNy threads on BlueGene/P: Exploring many-core parallelisms beyond The traditional OS	claim
152	113	Optimizing RAID for long term data archives	claim
153	113	Statistical predictors of computing power in heterogeneous clusters	claim
154	113	Modeling and analysis of real -time systems with mutex components	claim
155	110	How Algorithm Definition Language (ADL) improves the performance of SmartGridSolve applications	claim
156	110	Scalable failure recovery for high-performance data aggregation	claim
157	109	Unibus: Aspects of heterogeneity and fault tolerance in cloud computing	claim
158	109	Towards execution guarantees for stream queries	claim
159	108	A multi-source label-correcting algorithm for the all-pairs shortest paths problem	claim
160	108	Engineering a scalable high quality graph partitioner	claim
161	108	Hierarchical phasers for scalable synchronization and reductions in dynamic parallelism	claim
162	107	KRASH: Reproducible CPU load generation on many-core machines	claim
163	105	Mapping asynchronous iterative applications on heterogeneous distributed architectures	claim
164	105	Integrating parallel application development with performance analysis in periscope	claim
165	105	Linpack evaluation on a supercomputer with heterogeneous accelerators	claim
166	105	Using focused regression for accurate time-constrained scaling of scientific applications	claim
167	104	A dynamic approach for characterizing collusion in desktop grids	claim
168	104	Performance and energy optimization of concurrent pipelined applications	claim
169	103	A first step to the evaluation of SimGrid in the context of a real application	claim
170	103	Adapting to NAT timeout values in P2P overlay networks	claim
171	103	Varying bandwidth resource allocation problem with bag constraints	claim
172	102	Performance prediction of weather forecasting software on multicore systems	claim
173	102	Efficient DHT attack mitigation through peers' ID distribution	claim
174	100	High-level synthesis techniques for in-circuit assertion-based verification	claim
175	98	Toward understanding heterogeneity in computing	claim
176	97	Scheduling complex streaming applications on the Cell processor	claim
177	97	QoS assessment of WS-BPEL processes through non-Markovian stochastic Petri nets	claim
178	95	Reconciling scratch space consumption, exposure, and volatility to achieve timely staging of job input data	claim
179	95	Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers	claim
180	94	Direct self-consistent field computations on GPU clusters	claim
181	77	Transforming linear algebra libraries: From abstraction to parallelism	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers