Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Computer Engineering

An Energy-Efficient, Time-Constrained Scheduling Scheme In Local Mobile Cloud, Ting Shi May 2014

An Energy-Efficient, Time-Constrained Scheduling Scheme In Local Mobile Cloud, Ting Shi

UNLV Theses, Dissertations, Professional Papers, and Capstones

Mobile devices have limited resource, such as computation performance and battery life. Mobile cloud computing is gaining popularity as a solution to overcome these resource limitations by sending heavy computation to resourceful servers and receiving the results from these servers. Local mobile clouds comprised of nearby mobile devices are proposed as a better solution to support real-time applications. Since network bandwidth and computational resource is shared among all the mobile devices, a scheduling scheme is needed to ensure that multiple mobile devices can efficiently offload tasks to local mobile clouds, satisfying the tasks' time constraint while keeping low-energy consumption. Two …


Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel Dec 2013

Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Topic of this master's thesis is connected with task allocation algorithms and mesh networks. Author of this work has already graduated from Wroclaw, University of Technology (Poland) where during his studies he created software simulation environment for two different task allocation algorithms for mesh networks:Adaptive ScanandFrame Sliding. Those algorithms were compared by two, main parame- ters: simulation time and average mesh fulfillment (utilization level). All simulations were done in software environment which was developed specially for that research. This application was based on few, different types of objects: task (width, height, processing time), task queue (different number of tasks), task …


Decision Strategies For A P2p Computing System, Grzegorz Chmaj, Krzysztof Walkowiak Jan 2012

Decision Strategies For A P2p Computing System, Grzegorz Chmaj, Krzysztof Walkowiak

Electrical & Computer Engineering Faculty Research

Peer-to-Peer (P2P) computing (also called ‘public-resource computing’) is an effective approach to perform computation of large tasks. Currently used P2P computing systems (e.g., BOINC) are most often centrally managed, i.e., the final result of computations is created at a central node using partial results – what may be not efficient in the case when numerous participants are willing to download the final result. In this paper, we propose a novel approach to P2P computing systems. We assume that results can be delivered to all peers in a distributed way using three types of network flows: unicast, Peer-to-Peer and anycast. We …


Random Approach To Optimization Of Overlay Public-Resource Computing Systems, Grzegorz Chmaj, Krzysztof Walkowiak Mar 2010

Random Approach To Optimization Of Overlay Public-Resource Computing Systems, Grzegorz Chmaj, Krzysztof Walkowiak

Electrical & Computer Engineering Faculty Research

The growing need for computationally demanding systems triggers the development of various network-oriented computing systems organized in a distributed manner. In this work we concentrate on one kind of such systems, i.e. public-resource computing systems. The considered system works on the top of an overlay network and uses personal computers and other relatively simple electronic equipment instead of supercomputers. We assume that two kinds of network flows are used to distribute the data in the public-resource computing systems: unicast and peer-to-peer. We formulate an optimization model of the system. After that we propose random algorithms that optimize jointly the allocation …


Preliminary Study On Optimization Of Data Distribution In Resource Sharing Systems, Grzegorz Chmaj, Krzysztof Walkowiak Aug 2008

Preliminary Study On Optimization Of Data Distribution In Resource Sharing Systems, Grzegorz Chmaj, Krzysztof Walkowiak

Electrical & Computer Engineering Faculty Research

Grid structures are increasingly considered as very convergent with peer-to-peer networks. This paper presents a model of network acting both as grid and peer-to-peer network, used for data computation and distribution. Presented PPLC algorithm is a complete solution for both grid and peer-to-peer points of view. Problem formulation is presented, as well as solution heuristic algorithm and research results.


Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng Jan 2006

Efficient Scheduling For Sdmg Cioq Switches, Mei Yang, S. Q. Zheng

Electrical & Computer Engineering Faculty Research

Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate. In this paper, we propose to use a CIOQ switch with space-division multiplexing expansion and grouped input/output ports (SDMG CIOQ switch for short) to realize speedup while only requiring the switching fabric and memories to operate at the line …