Search For:

Displaying 1-50 out of 75 total
Dual-Region Location Management for Mobile Ad Hoc Networks
Found in: 2013 International Conference on Parallel and Distributed Systems (ICPADS)
By Yinan Li,Ing-Ray Chen,Ding-Chau Wang
Issue Date:December 2013
pp. 388-395
We propose and analyze a novel location management scheme for mobile ad hoc networks (MANETs) called Dual-region Mobility Management (DrMoM). The basic design concept of DrMoM is to use local regions to complement existing location services in MANETs that ...
 
Agent Recommendation for Agent-Based Urban-Transportation Systems
Found in: IEEE Intelligent Systems
By Cheng Chen,Shuang Shuang Li,Bo Chen,Ding Wen
Issue Date:November 2011
pp. 77-81
Mobile-agent technology has been adopted in many transportation fields to take advantages of different agents to deal with dynamic changes and uncertainty in traffic environments. However, few research studies have been conducted in urban-transportation sy...
 
Data Decomposition Based Partial Replication Model for Software Services
Found in: 2013 IEEE International Conference on Services Computing (SCC)
By Shuo Chen,Chi-Hung Chi,Chen Ding,Raymond K. Wong
Issue Date:June 2013
pp. 256-263
Nowadays many software services are hosted in the Cloud. When there are more requests on these services, there are also more queries sent to the underlying database. In order to keep up with the increasing workload, it is necessary to have multiple servers...
 
Defensive loop tiling for shared cache
Found in: 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)
By Bin Bao,Chen Ding
Issue Date:February 2013
pp. 1-11
Loop tiling is a compiler transformation that tailors an application's working set to fit in a cache hierarchy. On today's multicore processors, part of the hierarchy especially the last level cache (LLC) is shared. The available cache space in shared cach...
 
QoS Based Ranking for Web Search
Found in: Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on
By Xiangyi Chen, Chen Ding
Issue Date:December 2008
pp. 747-750
In this paper, we propose that the quality of the page delivery should play an important role in the page ranking process, especially for users with a slow Internet connection or mobile users. We define several important quality attributes and explain how ...
 
Selection Strategy of Rescue Servers Under Hot-Spot Congestion
Found in: Internet and Web Applications and Services, International Conference on
By Shijie Xu, Chi-Hung Chi, Cheng Qian, Chen Ding
Issue Date:May 2009
pp. 468-473
In this paper, we investigate selection strategies for rescue servers in a fully collaborative in which heterogeneous systems share spare resource to address hotspot problems experienced by individual members. Different from content replication, delays due...
 
Automatic Recommendation of Quality Requirements for Software Services
Found in: E-Business Engineering, IEEE International Conference on
By SiMing Li, Chi-Hung Chi, Chen Ding, Shuo Chen, Ying Huang
Issue Date:October 2007
pp. 679-685
QoS (Quality of Service) provisioning is an important factor that determines the success of any software service deployment. Defining what level of quality a software service should publish in the registry is a big challenge because of (i) the lack of requ...
 
A Test Integration Methodology for 3D Integrated Circuits
Found in: Asian Test Symposium
By Che-Wei Chou, Jin-Fu Li, Ji-Jan Chen, Ding-Ming Kwai, Yung-Fa Chou, Cheng-Wen Wu
Issue Date:December 2010
pp. 377-382
The three-dimensional (3D) integration technology using through silicon via (TSV) provides many benefits over the 2D integration technology. Although many different manufacturing technologies for 3D integrated circuits (ICs) have been presented, some chall...
 
Program phase detection and exploitation
Found in: Parallel and Distributed Processing Symposium, International
By Chen Ding,S. Dwarkadas,M.C. Huang, Kai Shen,J.B. Carter
Issue Date:April 2006
pp. 313
Studies of application behavior reveal the nested repetition of large and small program phases, with significant variation among phases in such characteristics as memory reference patterns, memory and energy usage, I/O activity, and occupancy of micro-arch...
 
An End-to-End QoS Mapping Approach for Cloud Service Selection
Found in: 2013 IEEE World Congress on Services (SERVICES)
By Raed Karim,Chen Ding,Ali Miri
Issue Date:June 2013
pp. 341-348
In order to select and rank the best services in a cloud computing environment, the end-to-end quality of service (QoS) values of cloud services have to be computed. For a new SaaS provider, the deployment of its software application in the cloud is a chal...
 
Incorporating User Behavior Patterns to Discover Workflow Models from Event Logs
Found in: 2013 IEEE International Conference on Web Services (ICWS)
By Xumin Liu,Hua Liu,Chen Ding
Issue Date:June 2013
pp. 171-178
We propose a novel approach to discover workflow models from event logs. The proposed approach addresses two major limitations of current process mining approaches. First, they assume either a single workflow model for the entire event log or the availabil...
 
Non-functional Requirement Analysis and Recommendation for Software Services
Found in: 2013 IEEE International Conference on Web Services (ICWS)
By Xiao-Lin Zhang,Chi-Hung Chi,Chen Ding,Raymond K. Wong
Issue Date:June 2013
pp. 555-562
Non-Functional (NF) requirement is very important for the success of a software service. Considering that there could be multiple services implementing a same function, it is crucial for software providers to understand the real NF demands from consumers s...
 
Modeling the Locality in Graph Traversals
Found in: 2012 41st International Conference on Parallel Processing (ICPP)
By Liang Yuan,Chen Ding,Daniel tefankovic,Yunquan Zhang
Issue Date:September 2012
pp. 138-147
An increasing number of applications in physical and social sciences require the analysis of large graphs. The efficiency of these programs strongly depends on their memory usage especially the locality of graph data access. Intuitively, the locality in co...
 
Efficient QoS-based Service Selection with Consideration of User Requirements
Found in: 2012 16th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2012)
By Anita Mohebi,Chen Ding,Chi-Hung Chi
Issue Date:September 2012
pp. 183-190
Many QoS-based service selection algorithms are complex and time-consuming, and sometimes require a lot of manual efforts from users. As a result, users' real-time searching experiences may not be good when there are many candidate services, because it cou...
 
Cache Conscious Task Regrouping on Multicore Processors
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Xiaoya Xiang,Bin Bao,Chen Ding,Kai Shen
Issue Date:May 2012
pp. 603-611
Because of the interference in the shared cache on multicore processors, the performance of a program can be severely affected by its co-running programs. If job scheduling does not consider how a group of tasks utilize cache, the performance may degrade s...
 
Delta Send-Recv for Dynamic Pipelining in MPI Programs
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Bin Bao,Chen Ding,Yaoqing Gao,Roch Archambault
Issue Date:May 2012
pp. 384-392
Pipelining is necessary for efficient do-across parallelism but the use is difficult to automate because it requires send-receive analysis and loop blocking in both sender and receiver code. The blocking factor is statically chosen. This paper presents a n...
 
Multiple non-functional criteria service selection based on user preferences and decision strategies
Found in: Service-Oriented Computing and Applications, IEEE International Conference on
By Raed Karim,Chen Ding,Chi-Hung Chi
Issue Date:December 2011
pp. 1-8
In order to choose from a list of functionally similar services, users often need to make their decisions based on multiple non-functional criteria they require on the target service. It is a natural fit to apply the Multi-Criteria Decision Making (MCDM) t...
 
Linear-time Modeling of Program Working Set in Shared Cache
Found in: Parallel Architectures and Compilation Techniques, International Conference on
By Xiaoya Xiang,Bin Bao,Chen Ding,Yaoqing Gao
Issue Date:October 2011
pp. 350-360
Many techniques characterize the program working set by the notion of the program footprint, which is the volume of data accessed in a time window. A complete characterization requires measuring data access in all O(n^2) windows in an n-element trace. Two ...
 
Quality-Driven Hierarchical Clustering Algorithm for Service Intelligence Computation
Found in: Semantics, Knowledge and Grid, International Conference on
By Yun Wei Zhao,Chi-Hung Chi,Chen DIng
Issue Date:October 2011
pp. 107-113
Clustering is an important technique for intelligence computation such as trust, recommendation, reputation, and requirement elicitation. With the user centric nature of service and the user's lack of prior knowledge on the distribution of the raw data, on...
 
Collaborative Filtering Based Service Ranking Using Invocation Histories
Found in: Web Services, IEEE International Conference on
By Qiong Zhang,Chen Ding,Chi-Hung Chi
Issue Date:July 2011
pp. 195-202
Collaborative filtering based recommender systems are very successful on dealing with the information overload problem and providing personalized recommendations to users. When more and more web services are published online, this technique can also help r...
 
An Enhanced PROMETHEE Model for QoS-Based Web Service Selection
Found in: Services Computing, IEEE International Conference on
By Raed Karim,Chen Ding,Chi-Hung Chi
Issue Date:July 2011
pp. 536-543
Since selecting a web service based on Quality of Services (QoS) is essentially a Multi-Criteria Decision Making (MCDM) problem, various MCDM models would be suitable for implementing the selection systems. A few of the MCDM approaches have been explored i...
 
Research on the Accuracy of Single Precision on Graphics Processing Unit
Found in: Multimedia and Signal Processing, International Conference on
By Tao Yuan, Zhu Mingfa, Xiao Limin, Ruan Li, Dongyi Guan, Siming Chen, Ding Yi
Issue Date:May 2011
pp. 57-60
The single precision in the computer is composed of two parts: the mantissa and the exponent. which are expressed by the limited binary bits. During adding on the single precision, the smaller one should shift to line up the decimal points, If the mantissa...
 
A QoS Query Language for User-Centric Web Service Selection
Found in: Services Computing, IEEE International Conference on
By Delnavaz Mobedpour, Chen Ding, Chi-Hung Chi
Issue Date:July 2010
pp. 273-280
One of the prerequisites for the success of a QoS-based web service selection process is an accurately formulated QoS query. It is usually not an easy task for users to formulate an accurate query considering the complexity of many current QoS languages an...
 
On the Reliability of Wireless Sensors with Software-Based Attestation for Intrusion Detection
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Ing-Ray Chen, Ding-Chau Wang
Issue Date:December 2009
pp. 184-189
Wireless sensor nodes are widely used in many areas, including military operation surveillance, natural phenomenon monitoring, and medical diagnosis data collection. These applications need to store and transmit sensitive or secret data, which requires int...
 
Fast Track: A Software System for Speculative Program Optimization
Found in: Code Generation and Optimization, IEEE/ACM International Symposium on
By Kirk Kelsey, Tongxin Bai, Chen Ding, Chengliang Zhang
Issue Date:March 2009
pp. 157-168
Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the correctness of the speculative code by running the original program on multiple...
 
Adaptive Quality Recommendation Mechanism for Software Service Provisioning
Found in: Web Services, IEEE International Conference on
By SiMing Li, Chen Ding, Chi-Hung Chi, Jianming Deng
Issue Date:September 2008
pp. 169-176
In this paper, we propose an adaptive quality recommendation mechanism to help software service providers understand the dynamism of quality demand from the majority of requesters accurately. The unique feature of our approach is that based on the intra-cl...
 
Fast Track: Supporting Unsafe Optimizations with Software Speculation
Found in: Parallel Architectures and Compilation Techniques, International Conference on
By Kirk Kelsey, Chengliang Zhang, Chen Ding
Issue Date:September 2007
pp. 414
The shift in processor technology toward multi-core, multi-processors opens new opportunities for software speculation where program code is speculatively executed to improve speed at the cost of having handle errors. In this paper we describe a new use of...
   
Miss Rate Prediction Across Program Inputs and Cache Configurations
Found in: IEEE Transactions on Computers
By Yutao Zhong, Steven G. Dropsho, Xipeng Shen, Ahren Studer, Chen Ding
Issue Date:March 2007
pp. 328-343
Improving cache performance requires understanding cache behavior. However, measuring cache performance for one or two data input sets provides little insight into how cache behavior varies across all data input sets and all cache configurations. This pape...
 
A Key-based Adaptive Transactional Memory Executor
Found in: Parallel and Distributed Processing Symposium, International
By Tongxin Bai, Xipeng Shen, Chengliang Zhang, William N. Scherer III, Chen Ding, Michael L. Scott
Issue Date:March 2007
pp. 308
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operations proceed in parallel. Many of these structures take the abstract form of a di...
 
A New Mechanism for Robots Control Based on Player/Stage
Found in: Robotics and Biomimetics, IEEE International Conference on
By Yan Xin-qing, Li Wen-feng, Chen Ding-fang
Issue Date:December 2006
pp. 750-754
The Player/Stage is a promising software architecture used in multiple and distributed robots control researches. But the continuous TCP data stream communication mechanism which it uses, as other robot control systems do, brings heavy burden both to the o...
 
Personalized Web Search with Self-Organizing Map
Found in: e-Technology, e-Commerce, and e-Services, IEEE International Conference on
By Chen Ding, Jagdish C. Patra, Fu Cheng Peng
Issue Date:April 2005
pp. 144-147
The widely used web search engines give different users the same answer set, although the users may have different preferences. Personalized web search carry out the search for each user with his preference. In order to reduce the wastage of time on browsi...
 
The Potential of Computation Regrouping for Improving Locality
Found in: SC Conference
By Chen Ding, Maksim Orlovich
Issue Date:November 2004
pp. 13
<p>Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are loaded into cache, the program performs all their operations before ...
 
The Energy Impact of Aggressive Loop Fusion
Found in: Parallel Architectures and Compilation Techniques, International Conference on
By YongKang Zhu, Grigorios Magklis, Michael L. Scott, Chen Ding, David H. Albonesi
Issue Date:October 2004
pp. 153-164
Loop fusion combines corresponding iterations of different loops. It is traditionally used to decrease program run time, by reducing loop overhead and increasing data locality. In this paper, however, we consider its effect on energy.<div></div>...
 
Adaptive Data Partition for Sorting Using Probability Distribution
Found in: Parallel Processing, International Conference on
By Xipeng Shen, Chen Ding
Issue Date:August 2004
pp. 250-257
Many computing problems benefit from dynamic partition of data into smaller chunks with better parallelism and locality. However, it is difficult to partition all types of inputs with the same high efficiency. This paper presents a new partition method in ...
 
A Generalized Site Ranking Model for Web IR
Found in: Web Intelligence, IEEE / WIC / ACM International Conference on
By Chen Ding, Chi-Hung Chi
Issue Date:October 2003
pp. 584
Normally, the unit for a ranking model in a web IR system is a web page, which is, sometimes, just an information fragment. A larger unit considering the linkage information may be desired to reduce the cognitive overload for users to identify the complete...
 
Miss Rate Prediction across All Program Inputs
Found in: Parallel Architectures and Compilation Techniques, International Conference on
By Yutao Zhong, Steven G. Dropsho, Chen Ding
Issue Date:October 2003
pp. 79
Improving cache performance requires understanding cache behavior. However, measuring cache performance for one or two data input sets provides little insight into how cache behavior varies across all data input sets. This paper uses our recently published...
 
Context Query in Information Retrieval
Found in: Tools with Artificial Intelligence, IEEE International Conference on
By Chi-Hung Chi, Chen Ding, Kwok-Yan Lam
Issue Date:November 2002
pp. 101
It is observed that there is an important query requirement missing for search engines. With the wide variation of domain knowledge and user's interest, a user would like to retrieve documents in which one query term is discussed in the context of another ...
 
Study for Fusion of Different Sources to Determine Relevance
Found in: Tools with Artificial Intelligence, IEEE International Conference on
By Chi-Hung Chi, Chen Ding, Kwok-Yan Lam
Issue Date:November 2002
pp. 515
The relevance of a web document could be measured not only by its text content, but also by some other factors such as the link connectivity, the usage pattern. In previous data fusion researches, the text is the only source to determine the relevance, and...
 
Improving Effective Bandwidth through Compiler Enhancement of Global Cache Reuse
Found in: Parallel and Distributed Processing Symposium, International
By Chen Ding, Ken kennedy
Issue Date:April 2001
pp. 10038b
Reusing data in cache is critical to achieving high performance on modern machines because it reduces the impact of the latency and bandwidth limitations of direct memory access. To date, most studies of software memory hierarchy management have focused on...
 
Reverse mapping of referral links from storage hierarchy for Web documents
Found in: Tools with Artificial Intelligence, IEEE International Conference on
By Chen Ding, Chi-Hung Chi, V. Tam
Issue Date:November 2000
pp. 0216
Abstract: Due to the lack of back-pointers, information about the referral parent(s) of a given Web page is not usually available to Web surfers. This significantly reduces the effectiveness of Web surfing and information discovery. We propose a mechanism ...
 
The Memory Bandwidth Bottleneck and its Amelioration by a Compiler
Found in: Parallel and Distributed Processing Symposium, International
By Chen Ding, Ken Kennedy
Issue Date:May 2000
pp. 181
As the speed gap between CPU and memory widens, memory hierarchy has become the primary factor limiting program performance. Until now, the principal focus of hardware and software innovations has been overcoming latency. However, the advent of latency tol...
 
Response Time Behavior of Voting Schemes for Managing Replicated Data
Found in: Computer Software and Applications Conference, Annual International
By Ing-Ray Chen, Ding-Chau Wang, Chih-Ping Chu
Issue Date:October 1999
pp. 139
Voting is a simple and yet effective way of managing replicated data in distributed systems. In this paper we analyze its response time behavior. We investigate a technique for obtaining the access time distribution for requests that access replicated data...
 
User-Perceived Availability and Response-Time in Voting-Based Replicated Systems: A Case Study
Found in: Application-Specific Software Engineering and Technology, IEEE Workshop on
By Ing-Ray Chen, Ding-Chau Wang, Chih-Ping Chu
Issue Date:March 1999
pp. 103
In this paper, we develop a modeling method based on stochastic Petri nets (SPN) to allow user-perceived measures in voting-based replicated systems to be estimated. The merit of our approach is that user-arrival, maintenance, and node/link-failure or -rep...
   
Repairman Models for Replicated Data Management: A Case Study
Found in: Parallel and Distributed Information Systems, International Conference
By Ing-Ray Chen, Ding-Chau Wang
Issue Date:December 1996
pp. 0184
Abstract: Pessimistic control algorithms for replicated data permit only one partition to perform update operations at any time so as do ensure mutual exclusion of the replicated data object. Existing availability modeling and analyses of pessimistic contr...
 
Analyzing dynamic voting using Petri nets
Found in: Reliable Distributed Systems, IEEE Symposium on
By Ing-Ray Chen, Ding-Chau Wang
Issue Date:October 1996
pp. 44
Dynamic voting is considered a promising technique for achieving high availability in distributed systems with data replication. To date, stochastic analysis of dynamic voting algorithms is restricted to either site or link Markov models, but not both, pos...
 
Improving Software Pipelining With Unroll-and-Jam
Found in: Hawaii International Conference on System Sciences
By Steve Carr, Chen Ding, Philip Sweany
Issue Date:January 1996
pp. 183
To take advantage of recent architectural improvements in microprocessors, advanced compiler optimizations such as software pipelining have been developed. Unfortunately, not all loops have enough parallelism in the innermost loop body to take advantage of...
   
Cache rationing for multicore
Found in: Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '13)
By Chen Ding, Jacob Brock
Issue Date:June 2013
pp. 1-2
As the number of transistors on a chip increases, they are used mainly in two ways on multicore processors: first, to increase the number of cores, and second, to increase the size of cache memory. The two approaches intersect at a basic problem, which is ...
     
All-window data liveness
Found in: Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '13)
By Chen Ding, Pengcheng Li
Issue Date:June 2013
pp. 1-2
This paper proposes a new metric called all-window liveness, which is the average amount of live data in all time windows of a given length. The paper gives a linear-time algorithm to compute the average liveness for all window lengths and discusses potent...
     
A coldness metric for cache optimization
Found in: Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness (MSPC '13)
By Chen Ding, Michael C. Huang, Raj Parihar
Issue Date:June 2013
pp. 1-2
A "hot" concept in program optimization is hotness. For example, program optimization targets hot paths, and register allocation targets hot variables. Cache optimization, however, has to target cold data, which are less frequently used and tend to cause c...
     
Pacman: program-assisted cache management
Found in: Proceedings of the 2013 international symposium on International symposium on memory management (ISMM '13)
By Bin Bao, Chen Ding, Jacob Brock, Xiaoming Gu
Issue Date:June 2013
pp. 39-50
As caches become larger and shared by an increasing number of cores, cache management is becoming more important. This paper explores collaborative caching, which uses software hints to influence hardware caching. Recent studies have shown that such collab...
     
 1  2 Next >>