Sciweavers

874 search results - page 116 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
CLUSTER
2006
IEEE
14 years 9 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
15 years 4 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
CLUSTER
2002
IEEE
14 years 9 months ago
Location Selection for Active Services
Active services are application-specified programs that are executed inside the network. The location where the active service is executed plays an important role. The dynamic beha...
Roger Karrer, Thomas R. Gross
NSDI
2007
15 years 2 days ago
TightLip: Keeping Applications from Spilling the Beans
Access control misconfigurations are widespread and can result in damaging breaches of confidentiality. This paper presents TightLip, a privacy management system that helps user...
Aydan R. Yumerefendi, Benjamin Mickle, Landon P. C...
BMCBI
2010
116views more  BMCBI 2010»
14 years 9 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel