Sciweavers

1671 search results - page 229 / 335
» Hierarchical graph maps
Sort
View
JSSPP
2009
Springer
14 years 3 months ago
Limits of Work-Stealing Scheduling
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
Zeljko Vrba, Håvard Espeland, Pål Halv...
ICPP
2007
IEEE
14 years 3 months ago
Toward Automatic Data Distribution for Migrating Computations
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Di...
AGTIVE
2007
Springer
14 years 3 months ago
Assuring Consistency of Business Process Models and Web Services Using Visual Contracts
Abstract. Business process models describe workflows by a set of actions together with their ordering. When implementing business processes within a service-oriented architecture,...
Gregor Engels, Baris Güldali, Christian Solte...
COCOON
2007
Springer
14 years 3 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
FOCS
2006
IEEE
14 years 3 months ago
Better lossless condensers through derandomized curve samplers
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
Amnon Ta-Shma, Christopher Umans