Chinese︱Feedback︱Save this page

Login︱Register

• Elaborating Academic Views 　　　　 • Exchanging Innovative Ideas
• Protecting Intellectual Properties 　　• Fast Sharing Science Papers

Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China

Home > Papers > Computer-Architecture

There are 135 papers published in subject: > since this site started.

Results per page:

135 Total, 14 Pages | << First < Previous 1 2 3 4 5 6 7 Next > Last >>

Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Third-level Subject

Computer Network(89)
Computer System Design(5)
Distributed Processing Sy...(9)
Other Subjects of Compute...(3)
Parallel Processing(11)
Run Test and Performance ...(2)

Rank

Results per page:

135 Total, 14 Pages | << First < Previous 1 2 3 4 5 6 7 Next > Last >>

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.


	1. Learning from Wireless: a Prospective Approach to Human-Centered Computing
	LV Yong,LV Shaohe,WANG Xiaodong,ZHOU Xingming
	Computer Science and Technology 01 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:One of the most important topics in Human-Centered Computing (HCC) is to recognise human's activities. In this paper, the technology of wireless-based activity recognition is introduced. By using wireless signals, one can achieve Non-Line-Of-Sight (NLOS) recognition without carrying any devices. Also, it is easy to deploy a wireless-based recognition system due to the ubiquity of wireless communication systems. The basic idea is to detect different characteristics of signal propagation that correspond to the distinct human behaviors. As a result, action recognition is performed by analyzing the distinguishable features of signal propagation. This paper introduces the basic principles and applications of wireless-based activity recognition, and discusses the challenges and related performance metrics. Finally, open problems are discussed to point out the future research trends.
	TO cite this article:LV Yong,LV Shaohe,WANG Xiaodong, et al. Learning from Wireless: a Prospective Approach to Human-Centered Computing[OL].[ 1 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4694788


	2. Energy-Efficient Cooperative Communications with Shared Relay in Wireless Network
	Deng Hou, Huang Liu-Sheng, Leng Bing, Xu Hong-Li
	Computer Science and Technology 17 May 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the increasing of the number of mobile devices, energy-efficiency and quality-of-service (QoS) are both important for wireless network.In the recent years, cooperative communication (CC) has been proposed to achieve spatial diversity without additional equipments and antennas.It is indicated that a good relay assignment scheme of CC is effective in improving energy-efficiency greatly in many literatures.In this paper, we first introduce the feasibility of shared relay assignment to improve the energy-efficiency. Then, the Minimum Energy Consumption for capacity requirement (MEC) problem of CC with shared relay will be defined, and we show it is NP-hard. We propose a heuristic algorithm (SRAE) to solve this problem, which is based on the thought of greedy algorithm. We conduct abundant simulation experiments to evaluate the performance of our proposed algorithm. The simulation results show that the SRAE algorithm can save about 54% energy consumption in wireless network.
	TO cite this article:Deng Hou, Huang Liu-Sheng, Leng Bing, et al. Energy-Efficient Cooperative Communications with Shared Relay in Wireless Network[OL].[17 May 2016] http://en.paper.edu.cn/en_releasepaper/content/4691808

Saved Papers

Saved Papers


	3. A mobile devices energy measurement model for data compression and transmission
	ZHANG Yu,JIANG Xiangzhou,LIN Anhua,ZHANG Jianzhong
	Computer Science and Technology 22 December 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Cloud service has been widely used in people's daily life for its convenience and security. In general, there are two sub processes in the course of the interaction mobile devices and cloud servers: data compression and transmission. The former compresses data to save transmission time and data traffic. The latter push data to cloud servers for further processing from the mobile devices. However, both processes operate at a high energy consumption, which introduce extra energy cost to the energy-hungry mobile device and reduce the degree of user experience. In this paper, we present a test methodology for evaluating energy cost on mobile devices, and propose a power module for analyzing the energy consumption during data compression and transmission. In order to analyze the power consumption, we first investigate these two sub processes-data compression and data transmission in detail. Then we present an energy measurement methodology to perform energy detection for components on smartphones. Then we propose an energy cost model for data compression and transmission to describe the energy consumption during the interaction process. Finally we apply the energy measurement methodology to the experiment for different data compression and data transmission methods, and find an energy efficient data compression method for these two sub processes. The result shows when the transmission rate reaches 800KB/s, the zip method only costs 52.4% energy of the second energy-efficient method.
	TO cite this article:ZHANG Yu,JIANG Xiangzhou,LIN Anhua, et al. A mobile devices energy measurement model for data compression and transmission[OL].[22 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4668095


	4. Parallelizing the Count-Min Sketch Algorithm on the Multi-core Processors
	ZHANG Yu
	Computer Science and Technology 14 December 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In high-speed network monitoring, the ever-growing traffic calls for a high-performance solution for the computation of items' frequencies. The increasing number of cores in current commodity multi-core processors opens up new opportunities in parallelization. In this paper, we present a novel method that exploits the great parallel capability of multi-cores to speed up the famous Count-Min sketch algorithm. The proposed parallel Count-Min sketch algorithm equally distributes the input data stream into sub-threads which use the original Count-Min sketch algorithm to process the sub-streams. The counters in each local Count-Min sketch with frequency increments exceeding a pre-defined threshold are sent to a merging thread which is able to return the estimated frequencies satisfying the (epsilon, delta)-approximation requirement. The theoretical correctness and complexity analyses are presented. Experiments with real traffic traces confirm the theoretical analyses and demonstrate the excellent performance as well as the effects of parameters. The results show that the proposed parallel Count-Min sketch algorithm achieves near-linear speedup at the cost of greater memory use.
	TO cite this article:ZHANG Yu. Parallelizing the Count-Min Sketch Algorithm on the Multi-core Processors[OL].[14 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4668107


	5. Multi-packet decoding based on splitting same string for data retransmission in wireless sensor network
	Shaobin Cai,Dong jun,Feng Xiaoning,Pan Hongqi
	Computer Science and Technology 23 November 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In MDNCBR (Multi-packet Decoding and Network Coding based on Broadcasting Retransmission), the receiver cannot decode when the encoded packets include at least two same data packets, called same string, and more packets has to be retransmitted. In order to solve this problem, the same strings in encoded packets are split to remove the unnecessary redundancy, and MDSSS (Multi-packet Decoding based on Splitting Same String) is proposed in this paper. The simulation results show that, compared with MDNCBR, the number of packet retransmissions of MDSSS, caused by same packets, are much fewer, and the network throughput of MDSSS is improved greatly. MDSSS performs particularly better than MDGCBR in complex wireless sensor networks.
	TO cite this article:Shaobin Cai,Dong jun,Feng Xiaoning, et al. Multi-packet decoding based on splitting same string for data retransmission in wireless sensor network[OL].[23 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4664924


	6. ONMA: An Northbound Architecture for Building SDN Services Rapidly
	LIU Jia, ZHANG Bin
	Computer Science and Technology 12 November 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In Software-Defined Networking (SDN) architecture, the northbound API (NBI), as a high-level interface of SDN controller, provides a series of operation and services for network users. Vendors and research community have developed dozens of controllers, which brought a large number of NBIs to programmers. The difference between controllers and the expansion of NBI's number leads to reducing the efficiency of developing and building SDN services. In this paper, we propose an open NBI model architecture (ONMA), which is separated from controller and covers the maximum range of business scenarios. The ONMA is established on the basis of four kinds of models: entity model, capability model, user model and open model. The models can encapsulate all aspects of NBIs, especially the abstraction of NBI users. By using a domain-specific language to manipulate models, SDN developers can build NBI services rapidly on any networking infrastructure.
	TO cite this article:LIU Jia, ZHANG Bin. ONMA: An Northbound Architecture for Building SDN Services Rapidly[OL].[12 November 2015] http://en.paper.edu.cn/en_releasepaper/content/4660747


	7. Energy-Saving Scheme and Control Framework in Data Center Network
	Tao Xiaoqing,Zhang Yinghai
	Computer Science and Technology 23 September 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Modern data centers require abundant network devices, servers to provide high quality of various resources such as computing, storage and switching. Since data center network is designed for busy-hour load, it faces a problem that the average utilization rate of network devices is far below the total network capacity. In this paper, we propose an energy-saving scheme and a control framework based on OpenFlow to deal with this problem. To balance network capacity and energy saving, the key idea is to implement a comprehensive scheme with traffic prediction and management of switches. Our simulation results show that the scheme not only balances energy saving and network capacity nicely, but also optimizes response time with little extra energy consumption.
	TO cite this article:Tao Xiaoqing,Zhang Yinghai. Energy-Saving Scheme and Control Framework in Data Center Network[OL].[23 September 2015] http://en.paper.edu.cn/en_releasepaper/content/4655778


	8. A Worst-Case Pattern of Task Load Allocation and Execution for Multiprocessor Global Real-Time Scheduling
	Fengxiang Zhang,Alan Burns
	Computer Science and Technology 27 August 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Multiprocessor scheduling is known to be an NP-hard optimization problem, and no worst-case job arrival sequences have been identified for global scheduling real-time systems. In this paper, we present a novel idea to solve the problem of worst-case scenarios in global scheduling, and firstly introduce a hypothetical parallel executing system where any job except the studied one can be executed in parallel on all processors at any instant in time, we prove that such a hypothetical system leads to a worst-case scenario of any studied job's schedulability, therefore, the proposed results can be used for solving schedulability problems of multiprocessor global scheduling.
	TO cite this article:Fengxiang Zhang,Alan Burns. A Worst-Case Pattern of Task Load Allocation and Execution for Multiprocessor Global Real-Time Scheduling[OL].[27 August 2015] http://en.paper.edu.cn/en_releasepaper/content/4653089


	9. SLA-aware Energy-efficient Scheduling Scheme for Hadoop YARN
	LI Ping,JU Lei,JIA Zhiping
	Computer Science and Technology 08 June 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Apache Hadoop becomes ubiquitous for cloud computing which provide resources as services for multi-tenant applications. YARN (a.k.a. MapReduce 2.0) is one of the key feature in the second-generation Hadoop, which provides resource management and scheduling for large scale MapReduce environments. Two enormous challenges in the YARN scheduler are the abilities to automatically tailor and control resource allocations to different jobs for achieving their Service Level Agreements (SLAs), and minimize energy consumption of the overall cloud computing system. In this work, we propose an SLA-aware energy-efficient scheduling scheme which allocates appropriate amount of resources to MapReduce applications with YARN architecture. We perform job profiling to obtain the performance characteristics for different phases of a MapReduce application, which will be considered during resource provisioning in order to meet the completion deadlines specified by the application's SLA. Furthermore, an online userspace governor based dynamic voltage and frequency scaling (DVFS) scheme is designed in the YARN per-application ApplicationMaster to dynamically change the CPU frequency for upcoming tasks given the slack time between the actual execution time of completed tasks and expected completion time of the application. Experimental evaluation shows that our proposed scheme is both resource and energy efficient compared with the existing MapReduce scheduling policies.
	TO cite this article:LI Ping,JU Lei,JIA Zhiping. SLA-aware Energy-efficient Scheduling Scheme for Hadoop YARN[OL].[ 8 June 2015] http://en.paper.edu.cn/en_releasepaper/content/4645579


	10. Rough Set based K-Modes Clustering Algorithm with Hadoop Cloud Platform
	ZHANG Lisheng,ZHANG Jiong,LEI Dajiang
	Computer Science and Technology 21 April 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, in order to solve the problems that the traditional K-Modes clustering algorithm cannot efficiently handle massive amounts of data and cannot accurately calculating the dissimilarity between data objects attributes. Based on rough sets and cloud computing, proposed K-Modes clustering algorithm based MapReduce programming model and rough sets. Firstly, using rough set model to recalculate dissimilarity between data object attributes for improving the accuracy of the calculation of distances, then combine the advantages of Hadoop platform and MapReduce programming model, will be parallelized to achieve K-Modes algorithm based on rough sets. Through the experiment, when clustering high dimensional massive data, the improved algorithm reduces the computer time and get an effective clustering results. Experiments show that the proposed algorithm has better stability and scalability.
	TO cite this article:ZHANG Lisheng,ZHANG Jiong,LEI Dajiang. Rough Set based K-Modes Clustering Algorithm with Hadoop Cloud Platform[OL].[21 April 2015] http://en.paper.edu.cn/en_releasepaper/content/4639491

	Check out RSS, or use RSS reader to subscribe this item