Loading...
Search for:
fairness
0.116 seconds
A Study of Management Policies of Shared Resources in Modern SSDs with Multi-Programming
, M.Sc. Thesis Sharif University of Technology ; Sarbazi Azad, Hamid (Supervisor)
Abstract
Solid State Drives (SSDs) have an electronic architecture based on non-volatile memories. The unique merit of a SSD is its internal parallelism. Thus, adopting SSDs as the storage media in the storage systems in various devices, such as smart phones, personal computers, large workstations, and etc., improves the performance of the device, substantially. However, the conventional host interface protocols in SSDs, i.e. SATA and SAS, have critical limitations, like low bus bandwidth (maximum 12Gbps), and a single shared request queue. With such limitations, the host interface turns into a performance bottleneck in conventional SSDs. Therefore, the high performance provided by such SSDs cannot...
Improving Throughput and Secrecy Throughput Performance in Wireless Powered Communication Networks
,
Ph.D. Dissertation
Sharif University of Technology
;
Pakravan, Mohammad Reza
(Supervisor)
Abstract
In wireless powered communication networks (WPCNs), wireless nodes are charged via an access point. In these networks, an access point transfers power to the nodes, and then, the nodes use the received power to transmit their information to the access point. Due to the wireless transmission of the information, eavesdropping of it is an important vulnerability in these networks. The conventional method to resolve this security problem is using cryptography algorithms. However, this method needs key management and complex encryption algorithms to be used by the nodes, which may not be applicable. Physical layer security (PLS), which uses the channel characteristics, is a more suitable way to...
Fair and Efficient Cake Cutting
, M.Sc. Thesis Sharif University of Technology ; Ghodsi, Mohammad (Supervisor)
Abstract
Cake Cutting is an old problem that studies how to allocate a resource among a number of agents to achieve fairness or maximize the revenue by selling the chunks fairly. The primary assumption in the conventional methods of studying Cake Cutting was that the allocator knows everything about the agents and their valuation functions for the different cuts of the cake, which could be impossible in real life. Here we addressed a new setting for an online Cake Cutting problem with unconnected pieces and studied four different objectives upon the setting. There we studied fair and efficient Online Cake Cutting by means of linear fairness and envy freeness. We also added a payment rule to study the...