نتایج جستجو برای: block scheduling
تعداد نتایج: 225797 فیلتر نتایج به سال:
Daewoo Shipbuilding Company, one of the largest shipbuilders in the world, has been much troubled with planning and scheduling its production process for a long time since its establishment. To solve the problems, Korea Advanced Institute of Science and Technology (KAIST) and Daewoo have been jointly performing the DAS (DAewoo Shipbuilding Scheduling) Project for three years from 1991 to 1993. ...
Carrier Aggregation (CA) is one of the main features in Long Term Evolution– Advanced (LTE-A). CA allows the target peak data rates in excess of 1 Gbps in the downlink and 500 Mbps in the uplink to be achieved by aggregating multiple component carriers (CCs) of 20 MHz for each CC. When CA is being put to use, it is vital to complement LTE-A systems with a robust and suitable resource scheduling...
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. The basic block instruction scheduling problem is to find a minimum length schedule for a basic block—a straightline sequence of code with a single entry point and a single exit point—subject to precedence, latency, and resource constraints. Solving the problem exactly is known to be...
In the current healthcare environment, the cost of delivering patient care is an important concern for hospitals. As a result, healthcare organizations are being driven to maximize their existing resources, both in terms of infrastructure and human capital. Using a data-driven approach with analytical techniques from operations management can contribute towards this goal. More specifically, thi...
A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle i...
In this paper, we proposed a new approach for key scheduling algorithm which is an enhancement of the Rijndael key scheduling. This proposed algorithm was developed to improve the weaknesses that has in the Rijndael key schedule. The key schedule function in Rijndael block cipher did not receive the same amount of attention during design phase as the cipher components. Based on our research, th...
We propose repair pipelining , a technique that speeds up the performance in general erasure-coded storage. By carefully scheduling of failed data small-size units across storage nodes pipelined manner, reduces single-block time to approximately same as normal read for single block homogeneous environments. further design different extensions algorithms heterogeneous environments and multi-bloc...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید