Sciweavers

1205 search results - page 28 / 241
» On P Systems with Bounded Parallelism
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
ICPADS
2007
IEEE
14 years 1 months ago
ECHoP2P: Emergency call handling over peer-to-peer overlays
The impact of the peer-to-peer paradigm increases both in research and in industry. Still, serious applications for P2P-based systems are rare. On the other hand, Emergency Call H...
Kalman Graffi, Aleksandra Kovacevic, Kyra Wulffert...
PLDI
2009
ACM
14 years 6 days ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
HPCC
2005
Springer
14 years 1 months ago
Enabling the P2P JXTA Platform for High-Performance Networking Grid Infrastructures
Abstract. As grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important, and therefore the convergence of grid computing ...
Gabriel Antoniu, Mathieu Jan, David A. Noblet
FSTTCS
1995
Springer
13 years 11 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain