Filters








45,462 Hits in 6.8 sec

Sequential and parallel cellular automata-based scheduling algorithms

F. Seredynski, A.Y. Zomaya
2002 IEEE Transactions on Parallel and Distributed Systems  
In operation mode, discovered rules of cellular automata are able to automatically find an optimal or suboptimal solution of the scheduling problem for any initial allocation of a program graph in two-processor  ...  We present a number of experimental results for both sequential and parallel scheduling algorithms discovered in the context of a cellular automata-based scheduling system.  ...  The level h k of a node k is defined as h k ¼ b k ; for an exit node max l2successorsðkÞ ðh k þ a kl Þ þ b k ; for other nodes; & ð1Þ i.e., it is the maximal length of the longest path from a node k  ... 
doi:10.1109/tpds.2002.1041877 fatcat:sqyhaznmrvgedd6tsg4nood7lm

Optimal composition of real-time systems

Shlomo Zilberstein, Stuart Russell
1996 Artificial Intelligence  
However, efficient local compilation techniques, working on a single program structure at a time, yield globally optimal allocations for a large class of programs.  ...  The first problem is solved by a simple and general construction that incurs only a small, constant penalty. The second is solved by an off-line compilation process.  ...  Tom Dean in particular inspired an initial interest in anytime algorithms and has continued to provide important insights and comments.  ... 
doi:10.1016/0004-3702(94)00074-3 fatcat:7jahnmsew5a7xf6r5jmenzocge

A hybrid Branch-and-Bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems

Vladimir Shestak, Edwin K.P. Chong, Howard Jay Siegel, Anthony A. Maciejewski, Lotfi Benmohamed, I-Jeng Wang, Rose Daley
2008 Journal of Parallel and Distributed Computing  
This work addresses the problem of finding a robust initial allocation of resources to strings of applications that is able to absorb some level of unknown input workload increase without rescheduling.  ...  The proposed hybrid two-stage method of finding a near-optimal allocation of resources incorporates two specially designed mapping techniques: (1) the Permutation Space Genitor-Based heuristic, and (2)  ...  Similar to Branch-and-Bound, A is a structural exploration of the search tree, where the node with the best bound is selected for expansion.  ... 
doi:10.1016/j.jpdc.2007.05.011 fatcat:5qhdslypm5hjtcski6obw56rxy

All Structured Programs Have Small Tree Width and Good Register Allocation

Mikkel Thorup
1998 Information and Computation  
The register allocation problem for an imperative program is often modeled as the coloring problem of the interference graph of the controlflow graph of the program.  ...  The bounded tree decomposition may be derived directly from the parsing of a structured program, and it implies that the many techniques for bounded tree width may now be applied in compiler optimization  ...  FINDING THE SEPARATORS In this section, we present an efficient algorithm for finding the minimal separators of a listing of the vertices in a graph.  ... 
doi:10.1006/inco.1997.2697 fatcat:l4gl7z57obf4xiylcqe2yheeuq

Optimal Tasks Assignment for Multiple Heterogeneous Processors with Dynamic Re-assignment

Harendra Kumar, M. P. Singh, Pradeep Kumar Yadav
2005 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY  
In this paper we have developed a mathematical model for allocating "M" tasks of distributed program to "N" multiple processors (M>N) that minimizes the total cost of the program.  ...  a dynamic tasks allocation model.  ...  TCOST (A) =EC (A) +RC (A) +ITCC (A) +REC (A) In order to make the best use of the resources in a DCS we would like to find an assignment having minimum cost.  ... 
doi:10.24297/ijct.v4i2b2.3313 fatcat:no4gjgnbivhgdfnuqpips36ieq

Upper bound for defragmenting buddy heaps

Delvin C. Defoe, Sharath R. Cholleti, Ron K. Cytron
2005 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems - LCTES'05  
Our algorithm relocates less than twice the space relocated by an optimal algorithm to defragment the heap so as to respond to a single allocation request.  ...  Knuth's buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time.  ...  We would also like to thank Morgan Deters of Washington University for his feedback and assistance in editing this article.  ... 
doi:10.1145/1065910.1065942 fatcat:qahuwnru5fdhvokb45t7e6xnku

Upper bound for defragmenting buddy heaps

Delvin C. Defoe, Sharath R. Cholleti, Ron K. Cytron
2005 SIGPLAN notices  
Our algorithm relocates less than twice the space relocated by an optimal algorithm to defragment the heap so as to respond to a single allocation request.  ...  Knuth's buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time.  ...  We would also like to thank Morgan Deters of Washington University for his feedback and assistance in editing this article.  ... 
doi:10.1145/1070891.1065942 fatcat:zogzh34rdvg2vh4ihgkkw3ym5q

An efficient approximate algorithm for winner determination in combinatorial auctions

Yuko Sakurai, Makoto Yokoo, Koji Kamei
2000 Proceedings of the 2nd ACM conference on Electronic commerce - EC '00  
We introduce the idea of LDS to an existing algorithm based on the IDA* algorithm, which is guaranteed to find an optimal solution.  ...  This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions. This algorithm is based on limited discrepancy search (LDS).  ...  This is because all of the possible allocations in a search tree must be explored to guarantee that a search algorithm finds an optimal solution.  ... 
doi:10.1145/352871.352875 dblp:conf/sigecom/SakuraiYK00 fatcat:gepofjzscvhlrjnozrkqpjqp74

An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions [chapter]

Yuko Sakurai, Makoto Yokoo, Koji Kamei
2000 Lecture Notes in Computer Science  
We introduce the idea of LDS to an existing algorithm based on the IDA* algorithm, which is guaranteed to find an optimal solution.  ...  This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions. This algorithm is based on limited discrepancy search (LDS).  ...  This is because all of the possible allocations in a search tree must be explored to guarantee that a search algorithm finds an optimal solution.  ... 
doi:10.1007/3-540-45349-0_47 fatcat:zsunccxstjhvzjlqln6odqc2y4

Integrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation Problem

Eldrandaly
2009 American Journal of Applied Sciences  
Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area.  ...  In this study a new approach for solving MLUA problems was proposed by integrating Gene Expression Programming (GEP) and GIS.  ...  Thus, the phenotype of GEP consists of the same kind of ramified structure used in genetic programming, but the ramified structures created by GEP (expression trees) are the expression of a totally autonomous  ... 
doi:10.3844/ajassp.2009.1021.1027 fatcat:jthnljt6mzabtfx2vdmsncvu2q

Integrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation Problem

Khalid A. Eldrandaly
2009 American Journal of Applied Sciences  
Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area.  ...  In this study a new approach for solving MLUA problems was proposed by integrating Gene Expression Programming (GEP) and GIS.  ...  Thus, the phenotype of GEP consists of the same kind of ramified structure used in genetic programming, but the ramified structures created by GEP (expression trees) are the expression of a totally autonomous  ... 
doi:10.3844/ajas.2009.1021.1027 fatcat:52wf7vy4ufccfcahuaxi3cohby

Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees

Huahai He, Ambuj K. Singh
2007 Seventh IEEE International Conference on Data Mining (ICDM 2007)  
In this paper, we present an efficient approximation algorithm for the k-MST problem in large graphs.  ...  The algorithm has an O( √ k) approximation ratio and O(n log n + m log m log k + nk 2 log k) running time, where n and m are the number of vertices and edges respectively.  ...  Acknowledgements: This work was supported in part by NSF grants IIS-0612327, DBI-0213903 and by the ARO ICB grant DAAD19-03-D-0004.  ... 
doi:10.1109/icdm.2007.11 dblp:conf/icdm/HeS07 fatcat:aasoraur3vhbbl3qwyicznnzza

Scalable user data management in multi-tenant cloud environments

Pieter-Jan Maenhaut, Hendrik Moens, Veerle Ongenae, Filip De Turck
2014 10th International Conference on Network and Service Management (CNSM) and Workshop  
We describe a mathematical model for the allocation of tenant data which can be optimized using existing linear programming techniques, and introduce the BDAA-n and FDAA, two algorithms that will find  ...  Linear programming is an alternative for tenants with a higher number of subtenants, but the customizability of the algorithm for specific use cases is limited due to the need for linear functions.  ...  Basic Data Allocation Algorithm (BDAA) The Basic Data Allocation Algorithm (BDAA) algorithm will find the best allocation of tenant data for a single tenant with k subtenants by evaluating all possible  ... 
doi:10.1109/cnsm.2014.7014171 dblp:conf/cnsm/MaenhautMOT14 fatcat:pdt23cc5vjg25iwgkplf677nlm

Anytime Capacity Expansion in Medical Residency Match by Monte Carlo Tree Search [article]

Kenshi Abe, Junpei Komiyama, Atsushi Iwasaki
2022 arXiv   pre-print
To tackle the problem, we propose an anytime method that the upper confidence tree searches the space of capacity expansions, each of which has a resident-optimal stable assignment that the deferred acceptance  ...  Constructing a good search tree representation significantly boosts the performance of the proposed method.  ...  BB and UCT both utilize a tree structure and are an iterative process of refining a solution.  ... 
arXiv:2202.06570v2 fatcat:xzvx6eygqngh7po74dcfhxwply

Comparability graph coloring for optimizing utilization of stream register files in stream processors

Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying Zhang
2009 SIGPLAN notices  
We present a compiler algorithm that can find optimal or near-optimal colorings in stream IGs, thereby improving SRF utilization than the First-Fit bin-packing algorithm, the best in the literature.  ...  A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements.  ...  So the best SRF allocation returned by our algorithm gives an upper bound on the strip size to be used.  ... 
doi:10.1145/1594835.1504195 fatcat:rrdlakisovfnjbspoochdza6ja
« Previous Showing results 1 — 15 out of 45,462 results