The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper describes a compilation technique used to accelerate dataflow computations, common in deep neural network computing, onto Coarse Grained Reconfigurable Array (CGRA) architectures. This technique has been demonstrated to automatically compile dataflow programs onto a commercial massively parallel CGRA-based dataflow processor (DPU) containing 16000 processing elements. The DPU architecture...
This paper deals with ship scheduling and inventory management by considering both shipping costs and demurrage costs with hourly precision. First, the formulation of an optimization model of the problem is described. Then, a hierarchical scheduling approach is newly introduced, which enables us to get a schedule close to the optimal within reasonable computational time. Moreover, through some computational...
Wearable devices, such as wristbands, smart-watches, eyewear, and wearable bio-monitors have become the focus of much attention in past year. One in ten U.S. consumers over the age of 18 now owns a modern activity tracker. These ubiquitous devices are a natural platform for formation of ad hoc networks. With almost 40% of users are above the age of 45, these older adopters are focused on improving...
Today's data center topologies mostly comprise multi-rooted trees with many equal-cost paths between the (source, destination) node pairs. Equal Cost Multi-Path (ECMP) forwarding is extensively used to leverage the multipath diversity in data center networks. However, ECMP forwarding might reduce the overall throughput significantly because of the random hash collision between multiple large flows...
In this paper, we consider a wireless sensor network that consists of a group of sensor nodes estimating multiple independent LTI systems. Each point-to-point link between the sensor nodes is a slow frequency-flat fading channel and the states of the channel are described by a finite-state Markov channel (FSMC) model. We propose a transmission schedule of the sensors such that the overall estimation...
Reducing power and energy consumption in large scale networks remains a challenging problem. The increasing need to support multimedia applications in future Internets further compound this problem. This paper addresses a key issue of how to efficiently assign per-router flow delays and set per-processor execution speeds, along a routing path, to jointly minimize energy consumption and meet end-to-end...
In this work an Auto Guided Vehicles (AGV) scheduling and routing problem is considered with maximal and minimal time lags along with heterogeneous characteristics. A framework with dynamic flow control has been proposed for the execution of events dedicated to a fleet of AGVs. The proposed framework allows the setting up for missions which are defined by a set of routes and stations regardless of...
Nowadays many companies and organizations choose to deploy their applications in data centers to leverage resource sharing. The increase in tasks of multiple applications, however, makes it challenging for a data center provider to maximize its revenue by intelligently scheduling tasks in software-defined networking (SDN)-enabled data centers. Existing SDN controllers only reduce network latency while...
The Workforce Scheduling and Routing Problem refers to the assignment of personnel to visits across various geographical locations. Solving this problem demands tackling numerous scheduling and routing constraints while aiming to minimise total operational cost. One of the main obstacles in designing a genetic algorithm for this highly-constrained combinatorial optimisation problem is the amount of...
In this paper, we study the problem of energy minimization for multicasting in cognitive radio networks, using omnidirectional and directional antennas. Our objectives are to build the multicast routing tree and schedule the secondary users' transmissions such that the total energy consumption is minimized. We consider in this paper the energy consumption due to channels switching, and we study the...
The centralized control in Software Defined Networks paves the way for new services like Bandwidth Calendaring (BWC), where the possibility to shift temporally future bandwidth requests allows to efficiently use network resources. Assuming perfect knowledge of the calendar for all future bandwidth reservations is unrealistic. In this paper, we study the online version of the BWC problem presented...
Increasingly, proposals for new datacenter networking fabrics employ some form of traffic scheduling-often to avoid congestion, mitigate queuing delays, or avoid timeouts. Fundamentally, practical implementations require estimating upcoming traffic demand. Unfortunately, as our results show, it is difficult to accurately predict demand in typical datacenter applications more than a few milliseconds...
Mapping problems to Coarse Grained Reconfigurable Arrays (CGRA) has been researched for many years now. Yet, no feasible mapping algorithms are known that can be considered optimal or even near optimal. The main reason for this deficit is the complex nature of the mapping problem. It can be considered as a combined scheduling, binding and routing problem. It involves several constraints that need...
The Vehicle Sharing Rebalancing Problem (VSRP) consists in the search for relocation strategies, for a fleet of free access vehicles, in a way which avoid shortages or bottlenecks. We deal here with a deterministic version of this problem, which embraces both preemptive and non preemptive cases. We first address the issue of getting both lower bounds and worst case approximation ratio. Next we propose...
Flexible Manufacturing systems (FMS) are the systems possessing high complexity in design and operation. It is due to the fact that the FMS consists of machines with high flexibility that can process a variety of jobs in a number of machines. Basically, such systems are used for the batch production process. In aerospace industries where a batch production process is adopted, FMS has found a wide...
With the increasing demand for communication quality, improving the service quality has become the focus and difficulty of the research. The traditional method has its limitations. The cross layer design method can break the barriers between layers, and ensure the quality of service transmission. This article proposes a cross-layer scheme called Ad hoc On-demand Distance Vector Routing Cross-layer...
In this paper, we study the problem of jointly routing and scheduling traffic in an energy harvesting network. To this end, we leverage stochastic dual descent methods to propose a generalization of the well-known backpressure algorithm to energy harvesting networks. We name this policy energy harvesting backpressure (EH-BP) and show that it satisfies the fundamental property of backpressure-type...
Coarse-grained reconfigurable architectures (CGRAs) present an appealing hardware platform by providing the potential for high computation throughput, scalability, low cost, and energy efficiency. CGRAs consist of an array of function units and register files often organized as a two dimensional grid. The most difficult challenge in deploying CGRAs is compiler scheduling technology that can efficiently...
The single-chip crosspoint-queued (CQ) switch is a self-sufficient switching architecture enabled by state-of-art ASIC technology. Unlike the legacy input-queued or output-queued switches, this kind of switch has all its buffers placed at the crosspoints of input and output lines. Scheduling is also performed inside the switching core, and does not rely on instantaneous communications with input or...
We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and video. Power is consumed in only transmission of the data. We consider the case when the power used in transmission is a convex function of the data transmitted...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.