Sciweavers

1205 search results - page 43 / 241
» On P Systems with Bounded Parallelism
Sort
View
ESCIENCE
2007
IEEE
14 years 1 months ago
Peer-to-Peer Based Grid Workflow Runtime Environment of SwinDeW-G
Nowadays, grid and peer-to-peer (p2p) technologies have become popular solutions for large-scale resource sharing and system integration. For e-science workflow systems, grid is a...
Yun Yang, Ke Liu, Jinjun Chen, Joel Lignier, Hai J...
COR
2011
13 years 2 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
ICDCN
2011
Springer
12 years 11 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan
ICPP
2006
IEEE
14 years 1 months ago
Achieving Bounded Delay on Message Delivery in Publish/Subscribe Systems
Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short li...
Jinling Wang, Jiannong Cao, Jing Li, Jie Wu
IPPS
2008
IEEE
14 years 2 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka