Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

task completion probability

biblio

Visible to the public Optimizing Task Assignment with Minimum Cost on Heterogeneous Embedded Multicore Systems Considering Time Constraint

Submitted by grigby1 on Wed, 02/21/2018 - 1:37pm
  • Processor scheduling
  • Guaranteed Probability
  • Heterogeneous Embedded Multicore System
  • heterogeneous embedded multicore systems
  • heterogeneous multicore architectures
  • minimum cost
  • multiprocessing systems
  • optimal energy efficiency
  • optimizing task heterogeneous assignment with probability algorithm
  • OTHAP
  • processor and voltage assignment with probability problem
  • execution time
  • processor scheduling algorithm
  • PVAP problem
  • real-time embedded systems
  • system performance model
  • Task Assignment
  • task assignment optimization
  • task completion probability
  • time constraint
  • multicore computing security
  • Multicore Computing
  • Program processors
  • pubcrawl
  • Scalability
  • Algorithm design and analysis
  • energy consumption
  • real-time systems
  • Reliability
  • directed graphs
  • probability
  • Metrics
  • Signal processing algorithms
  • resilience
  • embedded systems
  • Resiliency
  • battery-based embedded systems
  • computer systems
  • DAG
  • data-dependent aperiodic tasks
  • directed acyclic graph
  • dynamic programming
  • dynamic programming algorithm
  • Energy Efficiency

Terms of Use  |  ©2023. CPS-VO