1257 search results - page 89 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
114
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
137
click to vote
WSC
1998
15 years 3 months ago
1998
We have taken a NIST molecular dynamics simulation program (md3), which was configured as a single sequential process running on a CRAY C90 vector supercomputer, and parallelized ...
127
click to vote
ICCCN
2008
IEEE
15 years 8 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
115
Voted
ICPADS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part...
107
Voted
ASPDAC
1995
ACM
15 years 5 months ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...