Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
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 …