Three-dimension scheduling under multi-cycle interconnect communications
نویسندگان
چکیده
منابع مشابه
Multi-Objective Scheduling Problem in a Three-Stage Production System
A three stage production system is considered in this paper. There are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. Suppose that a number of products of different kinds are ordered. Each product is assembled with a set of several parts. At first the parts are produced in the first stage with parallel machines a...
متن کاملCollective Communications on a Reconfigurable Optical Interconnect
Free-space optical interconnection is used to fashion a reconfigurable network. Latency hiding techniques are used to enhance its performance.For this network, we present and analyze broadcasting/multi-broadcasting algorithms that utilizes latency hiding and reconfiguration. A combined total exchange algorithm has been proposed based on a combination of the direct, and standard exchange algorit...
متن کاملmulti-objective scheduling problem in a three-stage production system
a three stage production system is considered in this paper. there are two stages to fabricate and ready the parts and an assembly stage to assembly the parts and complete the products in this system. suppose that a number of products of different kinds are ordered. each product is assembled with a set of several parts. at first the parts are produced in the first stage with parallel machines a...
متن کاملCollective Communications on a Reconfigurable Optical Interconnect
In this section, we introduce some techniques for implementing the beam routing, and collision avoidance in the recievers. Each node has a beam router, such as a computer generated hologram or a deformable mirror, which is capable of redirecting k (or 1 in the single-port model) optical beams concurrently. The reconfiguration (programming the computer generated hologram, or deforming the mirror...
متن کاملScheduling MapReduce Jobs Under Multi-round Precedences
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the average weighted completion time and consider scheduling on identical and unrelated parallel processors. For identical processors, we present LP-based O(1)approximation algorithms. For unrelated processors, the approxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2005
ISSN: 1349-2543
DOI: 10.1587/elex.2.108