Sciweavers

10 search results - page 1 / 2
» Performance Comparison of Processor Scheduling Strategies in...
Sort
View
IPPS
1997
IEEE
13 years 8 months ago
Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System
Abstract — Processor scheduling has received considerable attention in the context of shared-memory multiprocessor systems but has not received as much attention in distributed-m...
Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh ...
IPPS
1998
IEEE
13 years 8 months ago
Performance Sensitivity of Space Sharing Processor Scheduling in Distributed-Memory Multicomputers
- Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use spacesharing processor s...
Sivarama P. Dandamudi, Hai Yu
PLILP
1993
Springer
13 years 8 months ago
An OR Parallel Prolog Model for Distributed Memory Systems
This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distr...
Vicente Benjumea, José M. Troya
ISPA
2007
Springer
13 years 10 months ago
A Performance Comparison of the Contiguous Allocation Strategies in 3D Mesh Connected Multicomputers
The performance of contiguous allocation strategies can be significantly affected by the distribution of job execution times. In this paper, the performance of the existing contigu...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
AICCSA
2007
IEEE
99views Hardware» more  AICCSA 2007»
13 years 8 months ago
An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Mult
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...