Title of my website
Content of my website
- AMMCo-BD (Method Analysis)
- AMMCo-BD Operations
- What's New?
- Project || Ongoing
- AMMCo-BD News
- Consultants & Exceptional Network
- Useful Products Links
- Webmail (Login)
CEO-(Operations & Service chain) says about AMMCo-BD in "THE DAILY STAR" newspaper on Friday in a conference.....
In this paper we deal with the problem of
assigning a job load to dispersed processing devices
in a distributed system. A distributed system
consists of a collection of heterogeneous processing
capacities that can communicate with each
other. Examples, in computer or telecommunication
systems, include request routing in data communication
systems, distributed data processing,
parallel processing, or hierarchical memory systems.
Another example can be found in a manufacturing
plant where products can be processed
by several machines or work centers .
The job load can be defined as the number of
job arrivals to be fed into and then processed in
the system. Such a job load should be effectively
routed among processing devices of distributed
system so as to achieve further economy. For
instance, system designers can minimize the average
time jobs remain in the system by effectively
balancing jobs among processing devices.
In order to illustrate job load assignment policy,
let us consider a system where jobs arrive
randomly at heterogeneous processing devices.
These devices have different characteristics such
as expected processing capacities, reliabilities,
operating costs, etc. An important design issue in
a distributed system that consists of several processing
units is to determine how to effectively
route jobs to such devices. In contrast, job
scheduling on one processing unit typically implies
the determination of an order (sequencing)
in which to process jobs. In the distributed system
under study, individual jobs are processed by a
single processing unit.