IPPS 2008 - PDF Preprint Papers

IPPS 2008 International Parallel Processing Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPPS-2008 Paper

click to vote

IPPS
2008
IEEE

296views Distributed And Parallel Com...» more IPPS 2008»

Qthreads: An API for programming with millions of lightweight threads

14 years 5 months ago

Download www.sandia.gov

Large scale hardware-supported multithreading, an attractive means of increasing computational power, beneﬁts signiﬁcantly from low per-thread costs. Hardware support for ligh...

Kyle B. Wheeler, Richard C. Murphy, Douglas Thain

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	296	Qthreads: An API for programming with millions of lightweight threads	claim
2	295	Computational thinking and thinking about computing	claim
3	228	Multi-threaded data mining of EDGAR CIKs (Central Index Keys) from ticker symbols	claim
4	209	A modeling approach for estimating execution time of long-running scientific applications	claim
5	199	Parallel mining of closed quasi-cliques	claim
6	199	SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks	claim
7	192	Adaptive tuning in a dynamically changing resource environment	claim
8	192	Middleware support for delay-tolerant service provision in disconnected mobile ad hoc networks	claim
9	184	A wireless sensor network based closed-loop system for subsurface contaminant plume monitoring	claim
10	180	Analytic performance models for bounded queueing systems	claim
11	179	GPU acceleration of numerical weather prediction	claim
12	178	An adaptive parallel pipeline pattern for grids	claim
13	175	Adaptive Locality-Effective Kernel Machine for protein phosphorylation site prediction	claim
14	174	Design and optimization of a distributed, embedded speech recognition system	claim
15	173	An efficient, model-based CPU-GPU heterogeneous FFT library	claim
16	172	Financial modeling on the cell broadband engine	claim
17	170	Providing security to the Desktop Data Grid	claim
18	168	Optimal spot-checking to minimize the computation time in volunteer computing	claim
19	167	Replication in bandwidth-symmetric BitTorrent networks	claim
20	167	Impact of multicores on large-scale molecular dynamics simulations	claim
21	165	On performance bottleneck of anonymous communication networks	claim
22	164	An MPI tool for automatically discovering the switch level topologies of Ethernet clusters	claim
23	164	Towards effective automatic parallelization for multicore systems	claim
24	162	LiteLoad: Content unaware routing for localizing P2P protocols	claim
25	161	SWAMP: Smith-Waterman using associative massive parallelism	claim
26	161	Mobility control schemes with quick convergence in wireless sensor networks	claim
27	159	Improving software reliability and productivity via mining program source code	claim
28	159	Sweep coverage with mobile sensors	claim
29	158	Outlier detection in performance data of parallel applications	claim
30	158	Automatic middleware deployment planning on heterogeneous platforms	claim
31	157	Performance characterization and optimization of parallel I/O on the Cray XT	claim
32	157	High performance MPEG-2 software decoder on the cell broadband engine	claim
33	157	Translational research design templates, Grid computing, and HPC	claim
34	157	Faster matrix-vector multiplication on GeForce 8800GTX	claim
35	156	Algorithmic skeletons for the design of partially reconfigurable systems	claim
36	156	Lattice Boltzmann simulation optimization on leading multicore platforms	claim
37	155	Fast and efficient formation flocking for a group of autonomous mobile robots	claim
38	154	On the representation and multiplication of hypersparse matrices	claim
39	154	What is the best way to prove a cryptographic protocol correct?	claim
40	153	Scaling alltoall collective on multi-core systems	claim
41	153	Enabling personal clusters on demand for batch resources using commodity software	claim
42	152	Reducing wasted resources to help achieve green data centers	claim
43	151	A plug-and-play model for evaluating wavefront computations on parallel architectures	claim
44	151	Software monitoring with bounded overhead	claim
45	150	Scalable dynamic information flow tracking and its applications	claim
46	150	Energy efficient packet classification hardware accelerator	claim
47	149	Absolute Slicing in Peer-to-peer Systems	claim
48	148	Scalable methods for monitoring and detecting behavioral equivalence classes in scientific codes	claim
49	148	Assuring information quality in e-Science	claim
50	147	Random choices for churn resilient load balancing in peer-to-peer networks	claim
51	147	Smart proxies in Java RMI with dynamic aspect-oriented programming	claim
52	147	A study of master-slave approaches to parallelize NSGA-II	claim
53	147	A lock-free multi-threaded algorithm for the maximum flow problem	claim
54	147	Model-guided performance tuning of parameter values: A case study with molecular dynamics visualization	claim
55	146	On the Effectiveness of Rebuilding RNA Secondary Structures from Sequence Chunks	claim
56	146	Early experience with out-of-core applications on the Cray XMT	claim
57	145	An effective pointer replication algorithm in P2P networks	claim
58	145	Design of scalable dense linear algebra libraries for multithreaded architectures: the LU factorization	claim
59	143	Adaptive and dynamic intrusion detection by means of idiotypic networks paradigm	claim
60	143	Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude	claim
61	143	Balancing HPC applications through smart allocation of resources in MT processors	claim
62	142	A scalable configurable architecture for the massively parallel GCA model	claim
63	142	Build to order linear algebra kernels	claim
64	141	Enhancing the effectiveness of utilizing an instruction register file	claim
65	141	A simple power-aware scheduling for multicore systems when running real-time applications	claim
66	141	A genetic programming approach to solve scheduling problems with parallel simulation	claim
67	140	A parallel implementation of the Finite-Domain Time-Difference algorithm using MPJ express	claim
68	140	Measuring power and temperature from real processors	claim
69	140	Evaluation of dynamic scheduling methods in simulations of storm-time ion acceleration	claim
70	140	DC-SIMD : Dynamic communication for SIMD processors	claim
71	139	Intermediate checkpointing with conflicting access prediction in transactional memory systems	claim
72	139	Data throttling for data-intensive workflows	claim
73	139	A hash-TLB approach for MMU virtualization in xen/IA64	claim
74	138	Resource allocation in a client/server hybrid network for virtual world environments	claim
75	136	Enhancing application robustness through adaptive fault tolerance	claim
76	136	Modeling and analysis of power in multicore network processors	claim
77	136	Optimizing non-blocking collective operations for infiniband	claim
78	135	Towards feasibility and scalability of text search in peer-to-peer systems	claim
79	135	The design of a versatile, secure P2PSIP communications architecture for the public internet	claim
80	134	Online scheduling in grids	claim
81	133	Decentralized market-based resource allocation in a heterogeneous computing system	claim
82	133	Supporting high performance bioinformatics flat-file data processing using indices	claim
83	133	VT-ASOS: Holistic system software customization for many cores	claim
84	132	7th IEEE International Workshop on High Performance Computational Biology HiCOMB 2008	claim
85	132	SLA-based resource allocation in cluster computing systems	claim
86	132	Symbolic expression analysis for compiled communication	claim
87	132	Automatic generation of a parallel sorting algorithm	claim
88	132	Self-optimizing distributed trees	claim
89	131	A self-adaptive on-line task placement algorithm for partially reconfigurable systems	claim
90	131	Avoiding communication in sparse matrix computations	claim
91	131	Portioned static-priority scheduling on multiprocessors	claim
92	130	A transparent non-invasive file data model for algorithmic skeletons	claim
93	130	Designing passive synchronization for MPI-2 one-sided communication to maximize overlap	claim
94	129	Ordered index seed algorithm for intensive DNA sequence comparison	claim
95	129	A game theoretical data replication technique for mobile ad hoc networks	claim
96	129	A dynamic scheduling approach for coordinated wide-area data transfers using GridFTP	claim
97	128	ContinuStreaming: Achieving high playback continuity of Gossip-based Peer-to-Peer streaming	claim
98	128	Approximating max-min linear programs with local algorithms	claim
99	127	Parallel IP lookup using multiple SRAM-based pipelines	claim
100	127	Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI	claim
101	127	On utilization of contributory storage in desktop grids	claim
102	127	Multi-source video multicast in peer-to-peer networks	claim
103	126	Performance comparison of SGI Altix 4700 and SGI Altix 3700 Bx2	claim
104	126	Junction tree decomposition for parallel exact inference	claim
105	125	CoSL: A coordinated statistical learning approach to measuring the capacity of multi-tier websites	claim
106	125	Probabilistic allocation of tasks on desktop grids	claim
107	125	High-speed string searching against large dictionaries on the Cell/B.E. Processor	claim
108	125	PROD: Relayed file retrieving in overlay networks	claim
109	125	Reducing the run-time of MCMC programs by multithreading on SMP architectures	claim
110	125	NETEMBED: A network resource mapping service for distributed applications	claim
111	124	Autonomic power and performance management of high-performance servers	claim
112	124	Design of steering vectors for dynamically reconfigurable architectures	claim
113	124	Scalable data dissemination using hybrid methods	claim
114	123	Wait-free Programming for General Purpose Computations on Graphics Processors	claim
115	123	Parallelizing irregular C codes assisted by interprocedural shape analysis	claim
116	123	Immersive real-time large-scale network simulation: A research summary	claim
117	123	Looking at data	claim
118	122	Receiver-initiated message passing over RDMA Networks	claim
119	122	Overcoming scaling challenges in biomolecular simulations across multiple platforms	claim
120	122	Accurately measuring collective operations at massive scale	claim
121	122	Implementing an industrial-strength academic cyberinfrastructure at Purdue University	claim
122	122	Large scale execution of a bioinformatic application on a volunteer grid	claim
123	120	Achieving and assuring high availability	claim
124	119	Scalable server provisioning with HOP-SCOTCH	claim
125	119	Scheduling strategies for the bicriteria optimization of the robustness and makespan	claim
126	119	MVAPICH-Aptus: Scalable high-performance multi-transport MPI over InfiniBand	claim
127	119	Providing flow based performance guarantees for buffered crossbar switches	claim
128	119	Self-stabilizing population of mobile agents	claim
129	117	A Hybrid MPI design using SCTP and iWARP	claim
130	117	Fault-tolerant static scheduling for grids	claim
131	117	I/O performance on a massively parallel Cray XT3/XT4	claim
132	115	Energy-efficient high-performance storage system	claim
133	115	A distributed algorithmic framework for coverage problems in Wireless Sensor Networks	claim
134	115	Towards an adaptive task pool implementation	claim
135	114	Optimizing the data distribution layer of BOINC with BitTorrent	claim
136	114	Divisible Load Scheduling with Result Collection on Heterogeneous Systems	claim
137	114	Parallel option pricing with Fourier Space Time-stepping method on Graphics Processing Units	claim
138	114	Optimizing latency and reliability of pipeline workflow applications	claim
139	113	Computing low latency batches with unreliable workers in volunteer computing environments	claim
140	113	Heterogenous dating service with application to rumor spreading	claim
141	113	Massively parallel cosmological simulations with ChaNGa	claim
142	113	Making an SCI fabric dynamically fault tolerant	claim
143	113	Exploiting spatial parallelism in Ethernet-based cluster interconnects	claim
144	112	On synthesizing workloads emulating MPI applications	claim
145	111	On the need for query-centric unstructured peer-to-peer overlays	claim
146	110	Understanding the performance of streaming applications deployed on hybrid systems	claim
147	110	A multithreaded communication engine for multicore architectures	claim
148	110	Efficient and dependable overlay networks	claim
149	109	Massive supercomputing coping with heterogeneity of modern accelerators	claim
150	109	Implementation of NAMD molecular dynamics non-bonded force-field on the cell broadband engine processor	claim
151	109	Modeling and predicting application performance on parallel computers using HPC challenge benchmarks	claim
152	108	Programmability of the HPCS Languages: A case study with a quantum chemistry kernel	claim
153	108	Efficiency of tree-structured peer-to-peer service discovery systems	claim
154	107	Evaluation and tuning of the Level 3 CUBLAS for graphics processors	claim
155	106	We have it easy, but do we have it right?	claim
156	105	Parallelized preprocessing algorithms for high-density oligonucleotide arrays	claim
157	105	Simplifying resource sharing in voluntary grid computing with the grid appliance	claim
158	104	A deterministic multi-way rendezvous library for haskell	claim
159	104	Low power/area branch prediction using complementary branch predictors	claim
160	103	Parallel performance wizard: A performance analysis tool for partitioned global-address-space programming	claim
161	103	Is a non-uniform system of creatures more efficient than a uniform one?	claim
162	100	Grid-based research, development, and deployment in New York State	claim
163	97	Fault tolerant scheduling of precedence task graphs on heterogeneous platforms	claim
164	95	Model-based fault localization in large-scale computing systems	claim
165	93	Introducing gravel: An MPI companion library	claim
166	87	Towards a decentralized architecture for optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers