Search

Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, message sequencing which addresses the order in which messages are sent, has rarely been addressed. In this paper, we propose a set of scheduling techniques for single-hop WDM passive star networks, which address both the sequencing aspect and the assignment aspect of the problem, In particular, we develop two priority schemes for sequencing messages in a WDM network in order to increase the overall performance of the network. We evaluate the proposed algorithms, using analytical modeling and extensive discrete-event simulations, by comparing their performance with state-of-the-art scheduling algorithms that only address the assignment problem [9], We find that significant improvement in performance can be achieved using our scheduling algorithms where message sequencing and channel assignment are simultaneously taken into consideration. This suggests that, when scheduling messages in WDM networks, one has to consider message sequencing, as well as channel assignment. As a result, we anticipate that this research mill open new directions into the problem of on-line scheduling in WDM networks.

Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, message sequencing which addresses the order in which messages are sent, has rarely been addressed. In this paper, we propose a set of scheduling techniques for single-hop WDM passive star networks, which address both the sequencing aspect and the assignment aspect of the problem, In particular, we develop two priority schemes for sequencing messages in a WDM network in order to increase the overall performance of the network. We evaluate the proposed algorithms, using analytical modeling and extensive discrete-event simulations, by comparing their performance with state-of-the-art scheduling algorithms that only address the assignment problem [9], We find that significant improvement in performance can be achieved using our scheduling algorithms where message sequencing and channel assignment are simultaneously taken into consideration. This suggests that, when scheduling messages in WDM networks, one has to consider message sequencing, as well as channel assignment. As a result, we anticipate that this research mill open new directions into the problem of on-line scheduling in WDM networks.

Message sequencing and channel assignment are two important issues that need to be addressed when scheduling variable-length messages in a wavelength division multiplexing (WDM) network. Channel assignment addresses the problem of choosing an appropriate data channel via which a message is transmitted to a node. This problem has been addressed extensively in the literature. On the other hand, message sequencing which addresses the order in which messages are sent, has rarely been addressed. In this paper, we propose a set of scheduling techniques for single-hop WDM passive star networks, which address both the sequencing aspect and the assignment aspect of the problem, In particular, we develop two priority schemes for sequencing messages in a WDM network in order to increase the overall performance of the network. We evaluate the proposed algorithms, using analytical modeling and extensive discrete-event simulations, by comparing their performance with state-of-the-art scheduling algorithms that only address the assignment problem [9], We find that significant improvement in performance can be achieved using our scheduling algorithms where message sequencing and channel assignment are simultaneously taken into consideration. This suggests that, when scheduling messages in WDM networks, one has to consider message sequencing, as well as channel assignment. As a result, we anticipate that this research mill open new directions into the problem of on-line scheduling in WDM networks.

With more and more multiprocessor computers coming to the market and applications, system reliability is becoming a key issue of the multiprocessor systems. As there is an inherent characteristic of redundancy existing in the multiprocessor systems, the way to raise the reliability of the systems is turned to software strategy rather than m hardware redundancy. Aiming at realizing fault tolerance and making better utilization of system resources, this paper presents a fault tolerant strategy to raise the reliability for the multiprocessor systems, which utilizes a common class of operating system algorithm referred to as Self-Scheduling (SS). Simulation results have been analyzed to show the feasibility of the proposed fault tolerant policy.

With more and more multiprocessor computers coming to the market and applications, system reliability is becoming a key issue of the multiprocessor systems. As there is an inherent characteristic of redundancy existing in the multiprocessor systems, the way to raise the reliability of the systems is turned to software strategy rather than m hardware redundancy. Aiming at realizing fault tolerance and making better utilization of system resources, this paper presents a fault tolerant strategy to raise the reliability for the multiprocessor systems, which utilizes a common class of operating system algorithm referred to as Self-Scheduling (SS). Simulation results have been analyzed to show the feasibility of the proposed fault tolerant policy.

With more and more multiprocessor computers coming to the market and applications, system reliability is becoming a key issue of the multiprocessor systems. As there is an inherent characteristic of redundancy existing in the multiprocessor systems, the way to raise the reliability of the systems is turned to software strategy rather than m hardware redundancy. Aiming at realizing fault tolerance and making better utilization of system resources, this paper presents a fault tolerant strategy to raise the reliability for the multiprocessor systems, which utilizes a common class of operating system algorithm referred to as Self-Scheduling (SS). Simulation results have been analyzed to show the feasibility of the proposed fault tolerant policy.