Edwin Hsing-Mean Sha

From MaRDI portal
Revision as of 17:31, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Edwin Hsing-Mean Sha to Edwin Hsing-Mean Sha: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1773584

Available identifiers

zbMath Open sha.edwin-hsing-meanMaRDI QIDQ1773584

List of research outcomes

PublicationDate of PublicationType
QuanPath: achieving one-step communication for distributed quantum circuit simulation2024-01-25Paper
Contour: A Process Variation Aware Wear-Leveling Mechanism for Inodes of Persistent Memory File Systems2022-03-23Paper
Minimizing Access Cost for Multiple Types of Memory Units in Embedded Systems Through Data Allocation and Scheduling2018-07-18Paper
Optimizing Scheduling and Intercluster Connection for Application-Specific DSP Processors2018-07-09Paper
Towards the Design of Efficient and Consistent Index Structure with Minimal Write Activities for Non-Volatile Memory2018-06-27Paper
Retiming synchronous data-flow graphs to reduce execution time2017-09-08Paper
Efficient Variable Partitioning and Scheduling for DSP Processors With Multiple Memory Modules2017-09-08Paper
Scheduling to Optimize Cache Utilization for Non-Volatile Main Memories2017-06-20Paper
A New Design of In-Memory File System Based on File Virtual Address Framework2017-05-16Paper
Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP2012-07-26Paper
UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS2009-06-30Paper
Hardware/software optimization for array {\&} pointer boundary checking against buffer overflow attacks2006-10-10Paper
The fat-stack and universal routing in interconnection networks2006-08-04Paper
Combining extended retiming and unfolding for rate-optimal graph transformation2005-11-18Paper
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making2005-08-17Paper
Partitioning and scheduling DSP applications with maximal memory access hiding2005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q27518822001-10-21Paper
Minimizing average schedule length under memory constraints by optimal partitioning and prefetching2001-05-07Paper
Properties and algorithms for unfolding of probabilistic data-flow graphs2001-02-06Paper
https://portal.mardi4nfdi.de/entity/Q45015722001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q48918751996-11-20Paper
Optimal data scheduling for uniform multidimensional applications1996-01-01Paper
Maintaining bipartite matchings in the presence of failures1994-08-31Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Edwin Hsing-Mean Sha