Sciweavers

991 search results - page 66 / 199
» The query-flow graph: model and applications
Sort
View
CONCURRENCY
2006
112views more  CONCURRENCY 2006»
13 years 10 months ago
Implementing BPEL4WS: the architecture of a BPEL4WS implementation
e a set of very distinctive abstractions that result in significant modifications of the basic workflow model as outlined in pre-existing workflow model, see [2] for example. In pa...
Francisco Curbera, Rania Khalaf, William Nagy, San...
ICCAD
2000
IEEE
149views Hardware» more  ICCAD 2000»
14 years 3 months ago
Dynamic Response Time Optimization for SDF Graphs
Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods ...
Dirk Ziegenbein, Jan Uerpmann, Ralph Ernst
GLOBECOM
2006
IEEE
14 years 4 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
ASIAMS
2007
IEEE
14 years 5 months ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
HIPC
2007
Springer
14 years 5 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan