Filters








10,306 Hits in 4.0 sec

Author retrospective for analytical cache models with applications to cache partitioning

G. Edward Suh, George Kurian, Srinivas Devadas, Larry Rudolph
2014 25th Anniversary International Conference on Supercomputing Anniversary Volume -  
We summarize the history of the work, revisit primary observations and lessons that we learned from the modeling effort, and also briefly describe follow-up work to show how the research direction evolved  ...  Another set of techniques explored the cache partition space using hill climbing [5] , albeit with non-convex problems.  ...  Finally, cache miss curves were often non-convex and finding the optimal allocation efficiently was difficult.  ... 
doi:10.1145/2591635.2591662 dblp:conf/ics/SuhKDR14 fatcat:h3mvnn4xgzc3fbfmg3wy4pe7iq

Method of Resource Allocation in OFDMA Using Convex Optimization

Linata Sharnagat, Hemlata Harichand
2015 2015 Fifth International Conference on Communication Systems and Network Technologies  
By using convex optimization we convert the highly non convex resource allocation problem into a sequence of convex sub problems.  ...  This paper proposes the Resource allocation issues for multiuser wireless transmissions, based on orthogonal frequency division multiple Access (OFDMA) and convex optimization techniques which are widely  ...  The convex optimization problem is solved by using Lagrange dual method and geometric programming.  ... 
doi:10.1109/csnt.2015.153 fatcat:x7zjhd74urcdnbdpzjthhkmh3q

Joint stream allocation and scheduling for single-user MIMO communication in WMNs

M. Bansal, Aditya Trivedi
2011 2011 National Conference on Communications (NCC)  
Using these TCs, the joint stream allocation and scheduling problem is formulated as a linear programming (LP) and a convex program (CP) to obtain the maximum throughput and proportional fair solutions  ...  In this paper, we investigate the joint stream allocation and scheduling problem for single-user MIMO communication in WMNs with the objective of maximizing the demand satisfaction for a set of flows.  ...  as a convex program (CP).  ... 
doi:10.1109/ncc.2011.5734740 fatcat:csagkqnmrzedlgm4lvnsk5ttcq

Routing, Scheduling and Power Allocation in Generic OFDMA Wireless Networks: Optimal Design and Efficiently Computable Bounds

Rozita Rashtchi, Ramy H. Gohary, Halim Yanikomeroglu
2014 IEEE Transactions on Wireless Communications  
Another lower bound is obtained by enforcing the scheduling constraints through additional power constraints and a monomial approximation technique to formulate the design problem as a geometric program  ...  Using a change of variables, the first problem is transformed into a convex form.  ...  Chandra (Sekhar) Bontu and Dr. Jim Womack of BlackBerry (formerly Research In Motion (RIM)) for their support.  ... 
doi:10.1109/twc.2014.012814.131045 fatcat:j5c7dr5tjjc3fg46tyj2qzhuua

An efficient cross layer design for OFDMA-based wireless networks with channel reuse

Rozita Rashtchi, Ramy H. Gohary, Halim Yanikomeroglu
2013 2013 IEEE Global Communications Conference (GLOBECOM)  
Unfortunately, this problem is non-convex, and hence difficult to solve.  ...  The network employs channel reuse, whereby a frequency subchannel might be used simultaneously by multiple nodes.  ...  Bontu and Dr. J. Womack of BlackBerry (formerly, Research In Motion (RIM)) for their support.  ... 
doi:10.1109/glocom.2013.6831630 dblp:conf/globecom/RashtchiGY13 fatcat:obhqza2pb5fgtcqhsvncyk5w6a

Throughput Optimization in Wireless Networks with Multi-Packet Reception and Directional Antennas

J. Crichigno, M. Y. Wu, W. Shu
2009 2009 IEEE Wireless Communications and Networking Conference  
Due to the hardness of the problem, we propose a polynomial time scheme based on a combination of linear programming and approximation algorithm paradigms.  ...  The scheduling subproblem deals with finding the optimal schedulable sets, which are defined as subsets of links that can be scheduled or activated simultaneously.  ...  These techniques permit the simultaneous reception of multiple packets by a node, which in turn increases the capacity of wireless networks [1] .  ... 
doi:10.1109/wcnc.2009.4917992 dblp:conf/wcnc/CrichignoWS09 fatcat:i4jrr4rp5narxb5jomub4lhklq

Throughput Optimization in Multihop Wireless Networks with Multipacket Reception and Directional Antennas

Jorge Crichigno, Min You Wu, Sudharman Jayaweera, Wennie Shu
2011 IEEE Transactions on Parallel and Distributed Systems  
Due to the hardness of the problem, we propose a polynomial time scheme based on a combination of linear programming and approximation algorithm paradigms.  ...  The scheduling subproblem deals with finding the optimal schedulable sets, which are defined as subsets of links that can be scheduled or activated simultaneously.  ...  These techniques permit the simultaneous reception of multiple packets by a node, which in turn increases the capacity of wireless networks [1] .  ... 
doi:10.1109/tpds.2010.202 fatcat:vls3ynkh7fewxgnloyl623gysi

A joint routing and scheduling scheme for wireless networks with multi-packet reception and directional antennas

J. Crichigno, M. Y. Wu, J. Khoury, W. Shu
2009 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops  
The joint routing and scheduling problem is decoupled into routing and scheduling subproblems.  ...  The formulation takes into account the use of both directional and omni-directional antennas as well as the use of multiple transmitter interfaces per node.  ...  (d) A feasible schedule for the network in (b), assuming a (1, 2, β )-network, and (e) corresponding schedulable vectors and convex hull. Fig. 2 . 2 Linear Program 1 (LP1).  ... 
doi:10.1109/wowmom.2009.5282471 dblp:conf/wowmom/CrichignoWKS09 fatcat:vgcgm5cw4jayfenu4vrttzh5ny

Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs

Ashish Goel, Adam Meyerson
2005 Algorithmica  
Maximizing all symmetric concave functions, and 2. Minimizing all symmetric convex functions.  ...  For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objective functions.  ...  We would also like to thank Krishnan Kumaran for helpful discussions, and Bruce Hajek for pointing out the shorter (and more elegant) proof of theorem 4.4 which we have presented.  ... 
doi:10.1007/s00453-005-1177-7 fatcat:cpvvmi22p5al3llvxhqykrzlsa

User Scheduling and Power Allocation for Precoded Multi-Beam High Throughput Satellite Systems with Individual Quality of Service Constraints [article]

Trinh Van Chien and Eva Lagunas and Tung Hai Ta and Symeon Chatzinotas and Björn Ottersten
2021 arXiv   pre-print
Although the power allocation optimization is signomial programming, non-convex on a standard form, the solution can be lower bounded by the global optimum of a geometric program with a hidden convex structure  ...  A local solution to the joint user scheduling and power allocation problem is consequently obtained by a successive optimization approach.  ...  Useful Definitions This appendix provides the useful definitions popularly utilized in handling geometric and sigomial programs.  ... 
arXiv:2110.02525v1 fatcat:m5vsvtpeizakjbjo73hb2djd34

Conjoint Routing and Resource Allocation in OFDMA-Based D2D Wireless Networks

Rozita Rashtchi, Ramy H. Gohary, Halim Yanikomeroglu
2018 IEEE Access  
The first tier of the proposed technique uses a novel approach for splitting a set of highly non-convex constraints into effectively two sets of convex ones and optimization proceeds by using two loops  ...  In this paper, we develop a highly efficient twotier technique for jointly optimizing the routes, the subcarrier schedules, the time-shares and the power allocations in deviceto-device communication networks  ...  In that paper, a semi-definite programming was used to cluster nodes and then an exhaustive search was used to find the best subcarrier scheduling and power allocation combination in each cluster.  ... 
doi:10.1109/access.2018.2816817 fatcat:lfrai4223jdkrbnv5kiarcc2uu

A framework for exploiting task and data parallelism on distributed memory multicomputers

S. Ramaswamy, S. Sapatnekar, P. Banerjee
1997 IEEE Transactions on Parallel and Distributed Systems  
By controlling the number of processors used for each data parallel task in an application and by concurrently executing these tasks, we make program execution more efficient and, therefore, faster.  ...  However, as our experimental results show, this overhead is not a problem; execution of a program using task and data parallelism together can be significantly faster than its execution using data parallelism  ...  in the MDG using the Convex Programming Allocation Algorithm. 2) Schedule the allocated nodes using the Prioritized Scheduling Algorithm.  ... 
doi:10.1109/71.642945 fatcat:cjkbudercjg2fap7rz2aspq4ve

Energy-Efficient Resource Allocation in NOMA Heterogeneous Networks [article]

Haijun Zhang, Fang Fang, Julian Cheng, Keping Long, Wei Wang, and Victor C.M. Leung
2018 arXiv   pre-print
The energy-efficient user scheduling and power allocation schemes are introduced for the downlink 5G NOMA heterogeneous network for perfect and imperfect channel state information (CSI) respectively.  ...  In this article, to study the tradeoff between data rate performance and energy consumption in NOMA, we examine the problem of energy-efficient user scheduling and power optimization in 5G NOMA heterogeneous  ...  To solve this problem, DC programming approach and time-sharing method can be used to transform the non-convex combinatorial optimization problem into a convex optimization problem.  ... 
arXiv:1801.04552v1 fatcat:wglyecu7pbcnjawb4x5wocjapu

Sensor Resource Allocation for Tracking Using Outer Approximation

Amit S. Chhetri, Darryl Morrell, Antonia Papandreou-Suppappola
2007 IEEE Signal Processing Letters  
We formulate the scheduling problem as a binary convex programming problem and solve it using the outer approximation (OA) algorithm.  ...  Index Terms-Binary programming, outer approximation (OA), resource allocation, sensor scheduling, target tracking. 1070-9908/$25.00 © 2007 IEEE Authorized licensed use limited to: Arizona State University  ...  We pose this problem as a binary (0-1) convex programming problem, and we use the OA algorithm to obtain optimal solutions to the sensor scheduling problem.  ... 
doi:10.1109/lsp.2006.884007 fatcat:nj5pixugwvbepcs5xa2toprudi

Provably minimal energy using coordinated DVS and power gating

Nathaniel A. Conos, Saro Meguerdichian, Foad Dabiri, Miodrag Potkonjak
2014 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014  
We prove that a solution provided by our convex programming formulation that uses at most two versions of hardware, where each version uses its own constant voltages, is optimal.  ...  Comprehensive evaluation of the new approach demonstrates energy improvements over traditional DVS and DVS and power gating techniques by factors of 1.44X-2.97X and 1.44X-2.82X, respectively.  ...  We have developed a new approach that combines the effectiveness of static power gating and DVS techniques using a convex programming-based procedure.  ... 
doi:10.7873/date.2014.307 dblp:conf/date/ConosMDP14 fatcat:iz734ea3gzcyznpqae5q5sdiue
« Previous Showing results 1 — 15 out of 10,306 results