{"title":"Register Allocation by Incremental Graph Colouring for Clustered VLIW Processors","authors":"Xuemeng Zhang, Hui Wu, Haiyan Sun","doi":"10.1109/TrustCom.2013.113","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.113","url":null,"abstract":"This paper presents an incremental register allocator based on graph colouring for clustered VLIW processor. This register allocator is integrated with an instruction scheduler which schedules all the basic blocks of a program in reverse postorder and all the operations of each basic block based on their priorities. When scheduling an operation, the register allocator assigns physical registers to virtual registers of the operation by incremental graph colouring. Our approach is an integrated approach which can avoid the traditional phase ordering problem. We have simulated our approach and a previous approach CARS using a set of benchmarks. The simulation results show that our approach outperforms CARS by 9.03%, 13.43%, 10.35% for three processor models, respectively, in terms of the average schedule lengths of basic blocks.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126399612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SMC: A Shared Memory Based SpaceWire Controller Solution","authors":"Qingfeng Yu, Yijiao Chen, Xilong Mao, Bao-kang Zhao, Jinfeng Huang","doi":"10.1109/TrustCom.2013.157","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.157","url":null,"abstract":"Nowadays, as an emerging international standard, the SpaceWire buses become more and more popular in space applications, especially in the On Board Computer Systems. However, since most space CPUs have not integrated on-chip SpaceWire Controllers, it is important to design efficient SpaceWire Controllers with the assistance of external FPGA chips. As the speed of SpaceWire bus exceeds hundreds of Mbps, the SpaceWire Controller requires plenty of memory resources to send and receive packages. Nevertheless, the storage resources of radiation-tolerant space FPGA are severely constrained, especially for the commonly used antifuse FPGA families, i.e., actel RTAX series. Therefore, it is very critical and challenging to design a SpaceWire bus controller with few on-chip memory resource requirements. In this paper, we propose a novel design, SMC (Shared Memory based spacewire Controller). In SMC, the FPGA chip which implements the SpaceWire Controller is connected to the CPU memory buses, while the Shared Memory Chip, which contains the reading and writing FIFOs, is connected to the FPGA and shared by SpaceWire Controller and CPU. We carefully design the sub-modules of the SMC model, including the CPU interface module, SpaceWire transceiver module, flow control module and SRAM arbitration access module, etc.. To enhance the system performance, we design an efficient interrupt-based packet sending and receiving mechanism. We implement the SMC logic within an Actel A3P1000 FPGA, and evaluate its performance in a practical OBC platform. Experimental results show that, our SMC design can effectively reduce the memory requirements of SpaceWire controllers, and provides an effective solution to implement SpaceWire Controller of CPU based on FPGA.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123446412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ana Ferreira, Rosario Giustolisi, Jean-Louis Huynen, Vincent Koenig, G. Lenzini
{"title":"Studies in Socio-technical Security Analysis: Authentication of Identities with TLS Certificates","authors":"Ana Ferreira, Rosario Giustolisi, Jean-Louis Huynen, Vincent Koenig, G. Lenzini","doi":"10.1109/TrustCom.2013.190","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.190","url":null,"abstract":"Authenticating web identities with TLS certificates is a typical problem whose security depends on both technical and human aspects, and that needs, to be fully grasped, a socio-technical analysis. We performed such an analysis, and in this paper we comment on the tools and methodology we found appropriate. We first analysed the interaction ceremonies between users and the most used browsers in the market. Then we looked at user's understanding of those interactions. Our tools and our methodology depend on whether the user model has a non-deterministic or a realistic behaviour. We successfully applied formal methods in the first case. In the second, we had to define a security framework consistent with research methods of experimental cognitive science.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125493506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Adrian J. Duncan, S. Creese, M. Goldsmith, J. Quinton
{"title":"Cloud Computing: Insider Attacks on Virtual Machines during Migration","authors":"Adrian J. Duncan, S. Creese, M. Goldsmith, J. Quinton","doi":"10.1109/TrustCom.2013.62","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.62","url":null,"abstract":"The use of Virtual Machines (VMs) and Infrastructure-as-a-Service (IaaS) has risen dramatically and, according to Gartner, is set to continue rising with a compound annual growth rate predicted to be 41.7% over the four years to 2016. By using Cloud providers, organisations are reducing their capital expenditure on hardware, software and support, however, these same organisations are putting a great deal of trust in the provider offering a safe and secure platform for their data and resources. One of the biggest benefits of IaaS to the customer is the rapid elasticity of their provision. This elasticity can require relocation of a VM from one physical machine and / or one hypervisor to another. Whilst such migration is transparent and potentially seamless, it may also introduce vulnerability. We explore here the potential for a malicious insider to exploit vulnerabilities associated with mobile VMs to obtain large volumes of cloud-user data, and consider the possibility of detecting such attacks using current digital forensics and systems administration techniques.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Flavien Quesnel, A. Lèbre, Jonathan Pastor, Mario Südholt, D. Balouek
{"title":"Advanced Validation of the DVMS Approach to Fully Distributed VM Scheduling","authors":"Flavien Quesnel, A. Lèbre, Jonathan Pastor, Mario Südholt, D. Balouek","doi":"10.1109/TrustCom.2013.150","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.150","url":null,"abstract":"The holy grail for Infrastructure as a Service (IaaS) providers is to maximize the utilization of their infrastructure while ensuring the quality of service (QoS) for the virtual machines they host. Although the frameworks in charge of managing virtual machines (VM) on pools of physical ones (PM) have been significantly improved, enabling to manage large-scale infrastructures composed of hundreds of PMs, most of them do not efficiently handle the aforementioned objective. The main reason is that advanced scheduling policies are subject to important and hard scalability problems, that become even worse when VM image transfers have to be considered. In this article, we provide a new validation of the Distributed VM Scheduler approach (DVMS) in a twofold manner. First, we provide a formal proof of the algorithm based on temporal logic. Second, we discuss large-scale evaluations involving up to 4.7K VMs distributed over 467 nodes of the Grid'5000 testbed. As far as we know, these experiments constitute the largest in vivo validation that has been performed so far with decentralized VM schedulers. These results show that a cooperative approach such as ours permits to fix overload problems in a reactive and scalable way.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130492659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"What is the Pattern of a Botnet?","authors":"Tianzuo Wang, Huaimin Wang, Bo Liu, Peichang Shi","doi":"10.1109/TrustCom.2013.35","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.35","url":null,"abstract":"As complex, flexible and efficient platforms for network attacks, botnets are considered as one of the most serious threats to current Internet security. The evolution and diversification of botnets call for a clear and fine grained taxonomy, but existing taxonomies are either incomplete or overlapping. In order to classify botnets accurately, we propose a concept called control structure to exactly and uniformly describe how botnets are controlled by botmasters. From the point of control structure, we classify botnets into certain patterns. Our taxonomy not only helps to understand botnets better, but also is useful for defenders when considering how to take down a botnet. Further, through comparison between different patterns, we predict that the P pattern and F-(O, P) pattern would be the most important trends for botnets, and the F layer would less likely appear without a P layer.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124650983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DataSteward: Using Dedicated Compute Nodes for Scalable Data Management on Public Clouds","authors":"R. Tudoran, Alexandru Costan, Gabriel Antoniu","doi":"10.1109/TrustCom.2013.129","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.129","url":null,"abstract":"A large spectrum of scientific applications, some generating data volumes exceeding petabytes, are currently being ported on clouds to build on their inherent elasticity and scalability. One of the critical needs in order to deal with this \"data deluge\" is an efficient, scalable and reliable storage. However, the storage services proposed by cloud providers suffer from high latencies, trading performance for availability. One alternative is to federate the local virtual disks on the compute nodes into a globally shared storage used for large intermediate or checkpoint data. This collocated storage supports a high throughput but it can be very intrusive and subject to failures that can stop the host node and degrade the application performance. To deal with these limitations we propose DataSteward, a data management system that provides a higher degree of reliability while remaining non-intrusive through the use of dedicated compute nodes. DataSteward harnesses the storage space of a set of dedicated VMs, selected using a topology-aware clustering algorithm, and has a lifetime dependent on the deployment lifetime. To capitalize on this separation, we introduce a set of scientific data processing services on top of the storage layer, that can overlap with the executing applications. We performed extensive experimentations on hundreds of cores in the Azure cloud: compared to state-of-the-art node selection algorithms, we show up to a 20% higher throughput, which improves the overall performance of a real life scientific application up to 45%.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129872642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhikun Chen, Shuqiang Yang, Shuang Tan, Ge Zhang, Huiyu Yang
{"title":"Hybrid Range Consistent Hash Partitioning Strategy -- A New Data Partition Strategy for NoSQL Database","authors":"Zhikun Chen, Shuqiang Yang, Shuang Tan, Ge Zhang, Huiyu Yang","doi":"10.1109/TrustCom.2013.140","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.140","url":null,"abstract":"With the development of Internet technology and Cloud Computing, more and more applications have to be confronted with the challenges of big data. NoSQL Database is fit to the management of big data because of the characteristics of high scalability, high availability, and high fault-tolerance. The data partitioning strategy plays an important role in the NoSQL database. The existing data partitioning strategies will cause some problems such as low scalability, hot spot, and low performance and so on. In this paper we proposed a new data partitioning strategy-HRCH, which can partitioning the data in a reasonable way. At last we use some experiments to verify the effectiveness of HRCH. It shows that HRCH can improve the system's scalability, avoid the hot spot problem as far as possible. At the same time it also can improve the parallel degree of processing, which can improve the system's performance in some processing.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115097089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fine-Grained Trust Assertions for Privacy Management in the Social Semantic Web","authors":"Owen Sacco, J. Breslin, S. Decker","doi":"10.1109/TRUSTCOM.2013.30","DOIUrl":"https://doi.org/10.1109/TRUSTCOM.2013.30","url":null,"abstract":"Social Web applications are engineered around users sharing personal information with their connected peers. They provide generic privacy settings which user specify with whom their information can be shared. However, this does not model the real world where one might trust someone with specific personal data but not with other data. Therefore, trust has to be taken into consideration when applying privacy settings. In our previous work, we modelled fine-grained privacy preferences without asserting trust. In this work, we add trust to our Privacy Preference Framework to provide more fine-grained enforcement of access control when sharing information. This ensures that users' personal information is accessed only by the intended third parties.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130813937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"AFC: An Effective Metric for Reliable Routing in Wireless Mesh Networks","authors":"Rakesh Matam, S. Tripathy","doi":"10.1109/TrustCom.2013.13","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.13","url":null,"abstract":"Routing metric plays a vital role in path selection process. A variety of routing metrics have been proposed to enhance the performance of routing protocols. Considering the forwarding behavior of neighbor node in the design of a routing metric would address the most generic packet dropping attacks in wireless mesh network (WMN). The existing routing metrics to address packet dropping attack in WMN only consider selfish mesh routers. On the other hand, to the best of our knowledge no such routing metric has been proposed to address the malicious behavior of mesh routers in a network. In this paper, we propose an airtime link metric AFC (Airtime Forwarding Capability), that considers both selfish and malicious behavior of mesh routers. AFC is computed using local station level measurements and does not require direct cooperation from any neighbor node, thereby avoiding neighbor lying attacks. The analysis of proposed metric shows that it satisfies the required design properties of a routing metric. The experimental results confirm the performance enhancement by accounting for the malicious behavior of mesh routers.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}