Sciweavers

1205 search results - page 82 / 241
» On P Systems with Bounded Parallelism
Sort
View
TPDS
1998
125views more  TPDS 1998»
13 years 7 months ago
An Efficient Dynamic Scheduling Algorithm For Multiprocessor Real-Time Systems
—Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for no...
G. Manimaran, C. Siva Ram Murthy
PE
2007
Springer
140views Optimization» more  PE 2007»
13 years 7 months ago
Stochastic analysis of file-swarming systems
File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file swarming system und...
Minghong Lin, Bin Fan, John C. S. Lui, Dah-Ming Ch...
APIN
1999
110views more  APIN 1999»
13 years 7 months ago
The Connectionist Inductive Learning and Logic Programming System
The Connectionist Inductive Learning and Logic Programming System, C-IL 2 P, integrates the symbolic and connectionist paradigms of Artificial Intelligence through neural networks...
Artur S. d'Avila Garcez, Gerson Zaverucha
LCPC
1994
Springer
13 years 11 months ago
Optimizing Array Distributions in Data-Parallel Programs
Data parallel programs are sensitive to the distribution of data across processor nodes. We formulate the reduction of inter-node communication as an optimization on a colored gra...
Krishna Kunchithapadam, Barton P. Miller
PODC
2009
ACM
14 years 8 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...