Feasible two-way circuit partitioning with complex resource constraints

2002 ◽  
Author(s):  
Hsun-Cheng Lee ◽  
Ting-Chi Wang
Keyword(s):  
Resource Constraints ◽  
Circuit Partitioning

scholarly journals FPGA Partitioning with Complex Resource Constraints

VLSI Design ◽  
2000 ◽  
Vol 11 (3) ◽  
pp. 219-235 ◽  
Author(s):  
Huiqun Liu ◽  
Kai Zhu ◽  
D. F. Wong
Keyword(s):  
Network Flow ◽  
Resource Constraints ◽  
Efficient Implementation ◽  
Experimental Results ◽  
Circuit Partitioning ◽  
Partitioning Methods ◽  
Partitioning Algorithm ◽  
Checking Procedure ◽  
Logic Emulation ◽  
Heterogeneous Resources

In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA device by counting the number of logic blocks, however this is not accurate with the increasing diverse resource types in the new FPGA architectures. We first propose a network flow based method to optimally check whether a circuit or a subcircuit is feasible for a set of available heterogeneous resources. Then the feasibility checking procedure is integrated in the FM-based algorithm for circuit partitioning. Incremental flow technique is employed for efficient implementation. Experimental results on the MCNC benchmark circuits show that our partitioning algorithm not only yields good results, but also is efficient. Our algorithm for partitioning with complex resource constraints is applicable for both multiple FPGA designs (e.g., logic emulation systems) and partitioning-based placement algorithms for a single large hierarchical FPGA (e.g., Actel's ES6500 FPGA family).

An Assessment of the Distribution of Public-Sector Educational Investment in Pakistan: 1970-71 - 1982-83 (Review Article, Note, Comment)

1986 ◽  
Vol 25 (2) ◽  
pp. 175-192
Author(s):  
Shahrukh Rafi Khan ◽  
Naushin Mahmood ◽  
Rehana Siddiqui
Keyword(s):  
Public Sector ◽  
Primary Education ◽  
Resource Constraints ◽  
Educational Planning ◽  
Review Article ◽  
Planning Theory ◽  
Limited Resources ◽  
Educational Investment ◽  
User Charges ◽  
Partial Success

Planning documents for the Seventies emphasized the importance of primary education and the curtailment of the mushrooming growth at the higher level. Our review suggests that this policy has had only partial success in implementation. Viewed in the context of educational planning theory and the evidence available for Pakistan, the policy is found to be sound. While the benefits of a correct distribution of investment within the educational sector are self-evident, resource constraints have been leading to an overall underinvestment in the educational sector. We show that Pakistan's public sector education is highly subsidized and so to supplement the limited resources devoted to it, we recommend, as a possible solution, a selective application of user charges.

Pre-Registration in the Undergraduate Dissertation: A Critical Discussion

2020 ◽  
Author(s):  
Madeleine Pownall
Keyword(s):  
Resource Constraints ◽  
Open Science ◽  
Critical Discussion ◽  
Perceived Barriers ◽  
Science Literature ◽  
Statistics Anxiety ◽  
Questionable Research Practices ◽  
Research Findings ◽  
Potential Benefits ◽  
Data Analysis Plan

Currently under review at Psychology Teaching Review. Over recent years, Psychology has become increasingly concerned with reproducibility and replicability of research findings (Munafò et al., 2017). One method of ensuring that research is hypothesis driven, as opposed to data driven, is the process of publicly pre-registering a study’s hypotheses, data analysis plan, and procedure prior to data collection (Nosek, Ebersole, DeHaven, & Mellor, 2018). This paper discusses the potential benefits of introducing pre-registration to the undergraduate dissertation. The utility of pre-registration as a pedagogic practice within dissertation supervision is also critically appraised, with reference to open science literature. Here, it is proposed that encouraging pre-registration of undergraduate dissertation work may alleviate some pedagogic challenges, such as statistics anxiety, questionable research practices, and research clarity and structure. Perceived barriers, such as time and resource constraints, are also discussed.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Sign in / Sign up

Export Citation Format

Share Document