Sciweavers

1993 search results - page 217 / 399
» Designing and Building Parallel Program
Sort
View
ICPP
2005
IEEE
15 years 7 months ago
Optimizing Collective Communications on SMP Clusters
We describe a generic programming model to design collective communications on SMP clusters. The programming model utilizes shared memory for collective communications and overlap...
Meng-Shiou Wu, Ricky A. Kendall, Kyle Wright
ICDCS
2003
IEEE
15 years 7 months ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande
CC
1999
Springer
116views System Software» more  CC 1999»
15 years 6 months ago
A Programmable ANSI C Transformation Engine
Abstract. Source code transformations are a very effective method of parallelizing and improving the efficiency of programs. Unfortunately most compiler systems require implementin...
Maarten Boekhold, Ireneusz Karkowski, Henk Corpora...
HIPC
2007
Springer
15 years 6 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
147
Voted
UAI
2007
15 years 3 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond