Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
-
- Electrical and Computer Engineering Faculty Publications and Presentations (2)
- All Graduate Theses and Dissertations, Spring 1920 to Summer 2023 (1)
- Dissertations (1)
- Research Collection School Of Computing and Information Systems (1)
- Turkish Journal of Electrical Engineering and Computer Sciences (1)
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.
Case Study Of Finite Resource Optimization In Fpga Using Genetic Algorithm, Jingxia Wang, Sin Ming Loo
Case Study Of Finite Resource Optimization In Fpga Using Genetic Algorithm, Jingxia Wang, Sin Ming Loo
Electrical and Computer Engineering Faculty Publications and Presentations
Modem Field-Programmable Gate Arrays (FPGAs) are becoming very popular in embedded systems and high performance applications. FPGA has benefited from the shrinking of transistor feature size, which allows more on-chip reconfigurable (e.g., memories and look-up tables) and routing resources available. Unfortunately, the amount of reconfigurable resources in a FPGA is fixed and limited. This paper investigates the mapping scheme of the applications in a FPGA by utilizing sequential processing (e.g., Altera Nios II or Xilinx Microblaze, using C programming language) and task specific hardware (using hardware description language). Genetic Algorithm is used in this study. We found that placing sequential …
Optimizing Reconfigurable Hardware Resource Usage In System-On-A-Programmable-Chip With Location-Aware Genetic Algorithm, Sin Ming Loo, Jingxia Wang
Optimizing Reconfigurable Hardware Resource Usage In System-On-A-Programmable-Chip With Location-Aware Genetic Algorithm, Sin Ming Loo, Jingxia Wang
Electrical and Computer Engineering Faculty Publications and Presentations
This paper presents static task scheduling using location-aware genetic algorithm techniques to schedule task systems to finite amounts of reconfigurable hardware. This research optimizes the use of limited reconfigurable resources. This scheduling algorithm is built upon our previous work [12- 14]. In this paper, the genetic algorithm has been expanded to include a feature to assign selected tasks to specific functional units. In this reconfigurable hardware environment, multiple sequential processing elements (soft core processors such as Xilinx MicroBlaze [22] or Altera Nios-II [1]), task-specific core (application specific hardware), and communication network within the reconfigurable hardware can be used (such a …
Mechanisms For Quality-Of-Service Provisioning In Networks With Extended Services, Zhen Qin
Mechanisms For Quality-Of-Service Provisioning In Networks With Extended Services, Zhen Qin
Dissertations
The emerging network traffic with various Quality-of-Service (QoS) requirements creates a demand for QoS service provisioning beyond the best effort service that Internet currently provides. QoS provisioning requires a framework that satisfies users' QoS and cost demand while maximizes benefits for network service providers. It is considered that QoS provisioning involves three issues: a) estimations of the network QoS performance, which can be achieved by performing network measurement; b) dissemination of the measured QoS states throughout the network with states exchanged among different network routers; and c) QoS routing. In this dissertation, these three issues are addressed.
In QoS networks, …
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Scheduling, placement, and routing are important steps in Very Large Scale Integration (VLSI) design. Researchers have developed numerous techniques to solve placement and routing problems. As the complexity of Application Specific Integrated Circuits (ASICs) increased over the past decades, so did the demand for improved place and route techniques. The primary objective of these place and route approaches has typically been wirelength minimization due to its impact on signal delay and design performance. With the advent of Field Programmable Gate Arrays (FPGAs), the same place and route techniques were applied to FPGA-based design. However, traditional place and route techniques may …
Filter Scheduling Function Model In Internet Server: Resource Configuration, Performance Evaluation And Optimal Scheduling, Minghua Xu
Wayne State University Dissertations
ABSTRACT
FILTER SCHEDULING FUNCTION MODEL IN INTERNET SERVER:
RESOURCE CONFIGURATION, PERFORMANCE EVALUATION AND
OPTIMAL SCHEDULING
by
MINGHUA XU
August 2010
Advisor: Dr. Cheng-Zhong Xu
Major: Computer Engineering
Degree: Doctor of Philosophy
Internet traffic often exhibits a structure with rich high-order statistical properties like selfsimilarity
and long-range dependency (LRD). This greatly complicates the problem of
server performance modeling and optimization. On the other hand, popularity of Internet
has created numerous client-server or peer-to-peer applications, with most of them,
such as online payment, purchasing, trading, searching, publishing and media streaming,
being timing sensitive and/or financially critical. The scheduling policy in Internet servers …
Behaviors Of Real-Time Schedulers Under Resource Modification And A Steady Scheme With Bounded Utilization, Refi̇k Samet, Orhan Fi̇kret Duman
Behaviors Of Real-Time Schedulers Under Resource Modification And A Steady Scheme With Bounded Utilization, Refi̇k Samet, Orhan Fi̇kret Duman
Turkish Journal of Electrical Engineering and Computer Sciences
In this article we present an analysis for task models having random resource needs and different arrival patterns. In hard real-time environments like avionic systems or nuclear reactors, the inputs to the system are obtained from real world by using sensors. And it is highly possible for a task to have different resource needs for each period according to these changing conditions of real world. We made an analysis of schedulers for task models having random resources in each period. Since feasibility tests for usual task models are just limited to some specific schedulers and arrival patterns, we made our …