Sciweavers

1855 search results - page 72 / 371
» A coding theorem for distributed computation
Sort
View
ICS
1997
Tsinghua U.
15 years 4 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali
104
Voted
PDP
2003
IEEE
15 years 5 months ago
Building Grid MPI Applications from Modular Components
Coupling grid applications developed by different teams requires code modification and high S/W engineering effort. In the Ensemble methodology message passing components are deve...
Yiannis Cotronis
130
Voted
IPPS
2007
IEEE
15 years 6 months ago
Multi-Core Model Checking with SPIN
—We present the first experimental results on the implementation of a multi-core model checking algorithm for the SPIN model checker. These algorithms specifically target shared-...
Gerard J. Holzmann, Dragan Bosnacki
103
Voted
ECOOPW
1998
Springer
15 years 4 months ago
Program Restructuring to Introduce Design Patterns
In restructuring legacy code it may be useful to introduce a design pattern in order to add clarity to the system and thus facilitate further program evolution. We show that aspec...
Mel Ó Cinnéide, Paddy Nixon
104
Voted
WETICE
1998
IEEE
15 years 4 months ago
Questionnaires: A Framework using Mobile Code for Component-Based Tele-Exams
Applications for computer supported cooperative work can gain from component models and frameworks. The framework for "questionnaires", which is described in this paper,...
Jakob Hummes, Arnd Kohrs, Bernard Mérialdo