A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Service Level Agreement-Based Joint Application Environment Assignment and Resource Allocation in Cloud Computing Systems
2013
2013 IEEE Green Technologies Conference (GreenTech)
Preserved Fulltext
In this paper, we consider the problem of SLA-based joint optimization of application environment assignment, request dispatching from the clients to the servers, as well as resource allocation in a data ...
the constructive partitioning algorithm in VLSI computer-aided design (CAD). ...
optimal resource allocation in the servers. ...
doi:10.1109/greentech.2013.33
fatcat:7kjwc7jnnnegjh6uzetkl4llb4
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
1999
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Congress on Evolutionary Computation
GALESIA
Neural
Network
Council
IEEE
1
2
1
2
3
4
5
Schedule =
task execution order
Binding =
mapping of tasks to
computing resources
Allocation ...
A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4), 1996. This EPS picture was not saved with a preview included in it. ...
doi:10.1109/4235.797969
fatcat:oj4jsgepezayxl4mbpelrkaewa
One-pass computation-aware motion estimation with adaptive search strategy
2006
IEEE transactions on multimedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the prior scheme, Tsai et al. propose that all macroblocks are processed simultaneously, and more computation is allocated to the macroblock with the largest distortion among the entire frame in a step-by-step ...
Moreover, in order to improve the video quality when the computation resource is still sufficient, the search pattern is allowed to adaptively change from diamond search to three step search, and then ...
of previous MBs to dynamically allocate the computation resources. ...
doi:10.1109/tmm.2006.876296
fatcat:iajiaogvjvg3zaod2w5k7ske5i
A Parallel Genetic Algorithm for Floorplan Area Optimization
2007
Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Floorplanning is an important problem in Very Large-Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. ...
Experimental results show that the parallel GA can produce better results than the sequential GA when they use the same amount of computing resources. ...
Acknowledgement The authors would like to thank Alvin Sebastian for his contributions to the implementation of the sequential GA, and Aaron Moore for his contributions to the implementation of the parallel ...
doi:10.1109/isda.2007.4389706
fatcat:5z7heqxgdfbaxoxc4wjdmjniq4
A Parallel Genetic Algorithm for Floorplan Area Optimization
2007
Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Floorplanning is an important problem in Very Large-Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. ...
Experimental results show that the parallel GA can produce better results than the sequential GA when they use the same amount of computing resources. ...
Acknowledgement The authors would like to thank Alvin Sebastian for his contributions to the implementation of the sequential GA, and Aaron Moore for his contributions to the implementation of the parallel ...
doi:10.1109/isda.2007.47
dblp:conf/isda/TangL07
fatcat:yrsx5f7tong5jklnjraizq7ilu
Partitioning-based decoupling capacitor budgeting via sequence of linear programming
2007
Integration
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. ...
Experimental results demonstrate the advantage of the proposed method over existing state-of-the-art methods in terms of solution quality at a mild computation cost increase. r ...
The idea is straightforward, but usually suffers from the difficulty of accurately estimating voltage drops and electric charge. Therefore, it cannot allocate decaps in an optimal way. ...
doi:10.1016/j.vlsi.2006.10.002
fatcat:lwvd6skmh5hgxkhd5v7owckrx4
A Game Theoretic Approach for Simultaneous Compaction and Equipartitioning of Spatial Data Sets
2010
IEEE Transactions on Knowledge and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The algorithm models a multistep, normal form game consisting of randomly initialized clusters as players that compete for the allocation of data objects from resource locations. ...
Further, the proposed algorithm yields a high value of fairness, a metric that indicates the quality of the solution in terms of simultaneous optimization of the objectives. ...
optimal bandwidth allocation in wired and wireless networks. ...
doi:10.1109/tkde.2009.110
fatcat:27guhbaiuzembcdvmkt356j7ve
Editorial
1992
Computer journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The separation of concurrency from parallelism 23 in the languages employed can usefully isolate the designing of resource allocation from the programming work. ...
VLSI. ...
doi:10.1093/comjnl/35.1.1
fatcat:7i6qb2atkvee3eu5lvbpmr3zu4
Testability Trade-Offs for BIST Data Paths
2004
Journal of electronic testing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
This paper focuses on BIST for RTL data paths and discusses testability trade-offs in terms of test application time, BIST area overhead and power dissipation. ...
Since plotting the entire solution space is beyond the computational capabilities of the state of the art computing resources, the results presented in sections 3, 4, and 5 have been obtained by randomly ...
Indeed, a large number of optimal or near-optimal solutions in terms of test application time and BIST area overhead may be found, but with different power dissipation. ...
doi:10.1023/b:jett.0000023680.46155.65
fatcat:ybp76lgyvzaebirp4344vfbv5m
Adaptive Differential Evolution For Optimal Schedule In Behavioral Level Synthesis
2016
IOSR Journal of VLSI and Signal processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The exploration and exploitation to global optimal scheduling with minimum convergence time and minimum number of computations are presented. ...
The adaptive scaling factor for mutation operation in differential evolution is implemented. The experiment results evaluate the performance parameters optimal resource schedule. ...
Resource scheduling in high level synthesis with differential evolution algorithm the number of functional units (adders, multipliers, etc.), as well as the subsequent allocation of hardware resources ...
doi:10.9790/4200-0604015559
fatcat:vfkee67bwvgafavue37vocg3pa
VLSI Design of A Chip With High Speed Atm Switch-A Review
2021
Turkish Journal of Computer and Mathematics Education
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this postulation, a VLSI execution of a multistage self-steering ATM switch texture which is one of the vital parts of the A/I Switch will be presented. The size of the switch model is 16x16. ...
In current computer communication network, it is overwhelmed by two technologies, in particular Asynchronous Transfer Mode (ATM) and Internet Protocol (IP). ...
The proposed resource allocation scheme finds the optimal bandwidth allocation and data drop rates under minimum quality-of-service (QoS) constraints. ...
doi:10.17762/turcomat.v12i2.1451
fatcat:yc5qikn3zrfqrbbtiguegwujnq
Page 3582 of Mathematical Reviews Vol. , Issue 90F
[page]
1990
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Introduction: “As a primitive for interprocess communication, synchronous message passing is desirable because it does not re- quire any dynamic allocation of resources in sending a message: all synchronization ...
As a consequence, each of the primitives can be executed in con- stant time and, as no exhaustible resources are consumed, delivery of the transmitted information is assured. ...
Very Large-Scale Integrated Processor
2013
International Journal of Networking and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the near future, improvements in semiconductor technology will allow thousands of resources to be implementable on chip. ...
We analyzed the cost in terms of the available number of clusters (adaptive processors with a minimum scale) and delay in Manhattan-distance of the chip, as well as its peak Giga-Operations per Second ...
Introduction Thousands of compute and memory resources will be implementable on-chip in the near future through improvements in a semiconductor technology. ...
doi:10.15803/ijnc.3.1_2
fatcat:yextja2il5hlhhdcrbypzzmwyy
Performance of Heuristics for a Computer Resource Allocation Problem
1984
SIAM Journal on Algebraic and Discrete Methods
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
"Resource Allocation under Limited Sharing," Discrete Applied Mathematics 28 (1990),
135-147, with M. P. Morford.
48. ...
(A preliminary version of a portion of this paper appeared in publication number 24.) 32. "On Finding Optimal and Near-Optimal Lineal Spanning Trees," Algorithmica 3 (1988), 549-560, with M. R. ...
doi:10.1137/0605017
fatcat:gndzhprr25h7lmueh4cv73mhky
Page 6562 of Mathematical Reviews Vol. , Issue 87k
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Many applications of our results can be found in a VLSI layout.”
87k:68131 ...
Comput. 34 (1985), no. 6, 578-584] is optimal with respect
to area-consumption (up to a constant factor). ...
« Previous
Showing results 1 — 15 out of 5,118 results