Sciweavers

1205 search results - page 4 / 241
» On P Systems with Bounded Parallelism
Sort
View
PPOPP
2010
ACM
13 years 7 months ago
Helper locks for fork-join parallel programming
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
GPC
2009
Springer
14 years 17 days ago
Efficient Parallelized Network Coding for P2P File Sharing Applications
In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that net...
Karam Park, Joon-Sang Park, Won Woo Ro
HIPC
2007
Springer
14 years 4 days ago
Structuring Unstructured Peer-to-Peer Networks
Flooding is a fundamental building block of unstructured peer-to-peer (P2P) systems. In this paper, we investigate techniques to improve the performance of flooding. In particular...
Stefan Schmid, Roger Wattenhofer
TPDS
1998
95views more  TPDS 1998»
13 years 5 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
IPPS
2009
IEEE
14 years 19 days ago
Peer-to-Peer beyond file sharing: Where are P2P systems going?
Are P2P systems and applications here to stay? Or are they a bright meteor whose destiny is to disappear soon? In this paper we try to give a positive answer to the first questio...
Renato Lo Cigno, Tommaso Pecorella, Matteo Sereno,...