Author image not provided
 Chun-Chen Hsu

  Affiliation history
Bibliometrics: publication history
Average citations per article2.75
Citation Count55
Publication count20
Publication years2005-2015
Available for download3
Average downloads per article456.67
Downloads (cumulative)1,370
Downloads (12 Months)143
Downloads (6 Weeks)11
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


20 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 20
Result page: 1 2

Sort by:

1 published by ACM
December 2015 ACM Transactions on Architecture and Code Optimization (TACO): Volume 12 Issue 4, January 2016
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 53,   Downloads (Overall): 211

Full text available: PDFPDF
Full system emulators provide virtual platforms for several important applications, such as kernel and system software development, co-verification with cycle accurate CPU simulators, or application development for hardware still in development. Full system emulators usually use dynamic binary translation to obtain reasonable performance. This paper focuses on optimizing the performance ...
Keywords: Control transfer optimizations, memory virtualization optimizations

2
August 2015 Journal of Systems Architecture: the EUROMICRO Journal: Volume 61 Issue 7, August 2015
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

With rapid advances in mobile computing, multi-core processors and expanded memory resources are being made available in new mobile devices. This trend will allow a wider range of existing applications to be migrated to mobile devices, for example, running desktop applications in IA-32 (x86) binaries on ARM-based mobile devices transparently ...
Keywords: Region formation optimization, Dynamic binary translation, Asynchronous computing, Client/server model

3 published by ACM
March 2013 VEE '13: Proceedings of the 9th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 21,   Downloads (Overall): 181

Full text available: PDFPDF
Most dynamic binary translators (DBT) and optimizers (DBO) target binary traces, i.e. frequently executed paths, as code regions to be translated and optimized. Code region formation is the most important first step in all DBTs and DBOs. The quality of the dynamically formed code regions determines the extent and the ...
Keywords: trace-based jit compilation, virtual machine, dynamic binary translation, hardware-based performance monitoring, hot region formation
Also published in:
August 2013  ACM SIGPLAN Notices - VEE '13: Volume 48 Issue 7, July 2013

4 published by ACM
March 2012 CGO '12: Proceedings of the Tenth International Symposium on Code Generation and Optimization
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 6,   Downloads (12 Months): 69,   Downloads (Overall): 978

Full text available: PDFPDF
Dynamic binary translation (DBT) is a core technology to many important applications such as system virtualization, dynamic binary instrumentation and security. However, there are several factors that often impede its performance: (1) emulation overhead before translation; (2) translation and optimization overhead, and (3) translated code quality. On the dynamic binary ...
Keywords: dynamic binary translation, LLVM, hardware performance monitoring, multi-threaded, multicores, traces, feedback-directed optimization

5
September 2011 ICPP '11: Proceedings of the 2011 International Conference on Parallel Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

This paper presents an LLVM+QEMU (LnQ)framework for building high performance and retargetable binary translators with existing compiler modules. Dynamic binary translation is a just-in-time (JIT) compilation from binary code of guest ISA to binary code of host ISA. The quality of translated code is critical to the performance of a ...
Keywords: Dynamic Binary Translation, Optimization, LLVM, QEMU

6
May 2011 ISPA '11: Proceedings of the 2011 IEEE Ninth International Symposium on Parallel and Distributed Processing with Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

In recent years, Data Grid becomes a promising technology to collect geographically distributed storage resources and provide a large amount of storage capacity. Such resources include personal computers, clusters or high-end servers managed by different administrative domains. Although many production Data Grids have been developed for various usages, there remain ...
Keywords: Data Grid, Data Transfer, Proxy Selection

7
February 2010 Future Generation Computer Systems: Volume 26 Issue 2, February, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 4

A Grid system is comprised of large sets of heterogeneous and geographically distributed resources that are aggregated as a virtual computing platform for executing large-scale scientific applications. As the number of resources in Grids increases rapidly, selecting appropriate resources for jobs has become a crucial issue. To avoid single point ...
Keywords: Resource selection, Grid computing, Bidding, Resource management, Matchmaking

8
June 2009 HPCC '09: Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

In the last decade, the evolution of distributed computing has shifted from cluster computing to Grid computing. Although bidding provides a useful means of resource allocation for this novel computing paradigm, there exist two challenges to scheduling metatasks in bidding-based Grid systems. (1) The scheduling algorithm has to avert collisions ...
Keywords: Metatask scheduling, bidding, Grid, makespan

9
April 2009 GPC '09: Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

In this paper, we design and implement a distributed file system with multi-source data replication ability, called Grid File System (GFS), for Unix-based grid systems. Traditional distributed file system technologies designed for local and campus area networks do not adapt well to wide area grid computing environments. Therefore, we design ...

10
April 2009 GPC '09: Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We study an online problem that occurs when the capacities of machines are heterogeneous and all jobs are identical. Each job is associated with a subset, called feasible set, of the machines that can be used to process it. The problem involves assigning each job to a single machine in ...
Keywords: Online algorithms, load, bi-objective optimization, throughput, job assignment

11
December 2008 APSCC '08: Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

In this paper, we propose a resource management model that extends the Contract Net Protocol by integrating the advantages of the matchmaking technique. Our model addresses the issues of matchmaker overload and the lack of up-to-date resource state information suffered by the original matchmaking model. It also enables resource requesters ...

12
May 2008 CCGRID '08: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We study the replication transition problem (RTP) in the Grid systems. Most distributed systems replicate data to increase data access efficiency. A replication strategy dictates where the replicas arestored in respond to data access pattern, and a good strategy can improve data access efficiency. However, the access patternin a distributed ...
Keywords: Data Grid, Grid Computing, Replica Transition Problem

13
December 2007 The Journal of Supercomputing: Volume 42 Issue 3, December 2007
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 3

In this paper, we address some problems related to server placement in Grid environments. Given a hierarchical network with requests from clients and constraints on server capability, the minimum server placement problem attempts to place the minimum number of servers that satisfy requests from clients. Instead of using a heuristic ...
Keywords: File replication, Workload, Queueing systems, Server placement, Waiting time, Grids

14
May 2007 GPC'07: Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

In Taiwan, a community of educational and research organizations interested in Grid computing technologies founded a Grid computing platform, called Taiwan UniGrid. Taiwan UniGrid consists of three primary portions: Computational Grid, Data Grid, and Web Portal. In this paper, we present the development of a virtual data storage system for ...
Keywords: data grid, data storage system, data transfer, single sign-on, web service

15
May 2007 GPC'07: Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network latencies of links, constraints on servers' capabilities and the service quality requirement, the solution to the minimum server placement problem attempts to place the ...

16
August 2006 ICPP '06: Proceedings of the 2006 International Conference on Parallel Processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

This paper introduces a new graph theory problem called generalized edge coloring (g.e.c.). A generalized edge coloring is similar to traditional edge coloring, with the difference that a vertex can be adjacent to up to k edges that share the same color. The concept of generalized edge coloring can be ...

17
May 2006 CCGRID '06: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 8

As the number of data-intensive applications increases in various domains, scientists need to save, retrieve, and analyze increasingly large datasets. The huge volume of data and the long latency of data transfer on the Internet make it very difficult to ensure high-performance access to Data Grids. Thus, data replication techniques ...

18
May 2006 GPC'06: Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

In this paper, we address some problems related to server placement in Grid environments. Given a hierarchical network with requests from clients and constraints on server capability, the minimum server placement problem attempts to place the minimum number of servers that satisfy clients requests. Instead of using a heuristic approach, ...

19
July 2005 ICPADS '05: Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

As data-intensive applications increase continuously in various domains, scientists nowadays need to save, retrieve and analyze rapidly increasing large datasets. The long latency of data transfer over Internet results in a serious challenge on ensuring high-performance access to large quantities of data. Furthermore, the vision of Grid researches is to ...
Also published in:
July 2005  ICPADS '05: Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02

20
July 2005 ICPADS '05: Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O subsystem has become the bottleneck of the overall system performance for years due to slower improvement of the second storage devices. In recent years parallel ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us