Sciweavers

2239 search results - page 322 / 448
» Computing with abstract matrix structures
Sort
View
IWOMP
2009
Springer
15 years 2 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
INFOCOM
2000
IEEE
15 years 2 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
ECAI
1994
Springer
15 years 2 months ago
Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
Giuseppe De Giacomo, Maurizio Lenzerini
POPL
1993
ACM
15 years 2 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
ESWS
2009
Springer
15 years 1 months ago
Hybrid Adaptive Web Service Selection with SAWSDL-MX and WSDL-Analyzer
Abstract. In this paper, we present an adaptive, hybrid semantic matchmaker for SAWSDL services, called SAWSDL-MX2. It determines three kinds of semantic service similarity with a ...
Matthias Klusch, Patrick Kapahnke, Ingo Zinnikus