By Topic

Computer Systems and Applications (AICCSA), 2011 9th IEEE/ACS International Conference on

Date 27-30 Dec. 2011

Filter Results

Displaying Results 1 - 25 of 66
  • [Front cover]

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (232 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (735 KB)  
    Freely Available from IEEE
  • Hub page

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (202 KB)  
    Freely Available from IEEE
  • Session list

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (26 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): 1 - 7
    Save to Project icon | Request Permissions | PDF file iconPDF (65 KB)  
    Freely Available from IEEE
  • Brief author index

    Page(s): 1 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (44 KB)  
    Freely Available from IEEE
  • Detailed author index

    Page(s): 1 - 31
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • The end of indexes

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (59 KB)  
    Freely Available from IEEE
  • [PDF Reader FAQ and support]

    Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (131 KB)  
    Freely Available from IEEE
  • [PDF Reader FAQ and support]

    Page(s): 1 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (460 KB)  
    Freely Available from IEEE
  • Message from the AICCSA2011 general chairs

    Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (133 KB)  
    Freely Available from IEEE
  • Message from the AICCSA2011 program chairs

    Page(s): 1 - 2
    Save to Project icon | Request Permissions | PDF file iconPDF (182 KB)  
    Freely Available from IEEE
  • AICCSA 2011 Conference Committees

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • Keynote talk by Dr. Albert Zomaya: Environmentally sustainable large scale distributed systems

    Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (42 KB)  

    Summary form only given. Half perimeter wire length estimation is commonly used to guide placers in positioning cells. In this paper, the shortcomings of HPWL and other post placement wire length estimation methods are presented first. It is shown that these estimations are even more inaccurate when congestion exists. Techniques to improve the accuracy of estimation are proposed. In addition, the hidden costs are discussed when performing placement with a complete 2D view, where routes are actually made in 3D. Techniques to reduce the hidden costs are proposed. Finally, a few problems arise during the formulation of global routing because of using bin boxes and methods to avoid these problems are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keynote talk by Dr. Jean-Luc Gaudiot: Fighting Amdahl's law in many-core and GPU parallel architectures with value prediction

    Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (95 KB)  

    Summary form only given. The next grail sought by HPC community is the exascale, 100 times the current scale. This target will not be reached easily as many challenges are uprising. The first challenge, the Energy consumption, has become a strict constraint now with a limit set to 20MW (twice as the current top supercomputers). Multiplying the computing elements will imply to drastically reduce the power consumption of each of them. The second challenge will be to keep it cool as: first the overall power envelope, 20MW, include the energy for cooling and second, because 20MW will be turned into heat by joule effect. And the operating temperature of electronic must be bounded otherwise, the leakage (and thus the power consumption) increases and the reliability decreases. This brings us to a third challenge regarding the reliability of the machine, the number of components will be tremendous, thus, the probability of having failing ones will increase. It has to be managed in such a way that applications will not be impacted by the failures. Finally, The last challenge is related to the software stack of these supercomputers, how will we manage billions of threads, how will we debug it, … New paradigms are currently being studied, for instance Bag of tasks, that try to tackle these aspects. These are the challenges we have to solve!! In this presentation, brightened up with insight into Bull roadmap, we present a possible future. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Keynote talk by Dr. Frederica Darema: New frontiers through information technologies

    Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (46 KB)  

    Summary form only given. Today, software is being developed and maintained not just by engineers educated formally but also by people from widely different backgrounds including children, knowledge workers among many others. However, a number of studies indicate that most of these people are not equipped with enough software engineering skills leading to low-quality software. On the other hand, an analysis of literature reveals that the significant potential of learning theories (LTs) like Learning by Doing, Reflection, Model-based and so on has not been fully utilized by Software Engineering Education (SEE) and Training community. In this context, the main thrust of this poster is to emphasize the need for using vast amount of LTs (nearly 110) available to effectively and efficiently teach software engineering and help in producing quality software engineers. In this poster, we motivate the need for use of LTs in SEE, while summarizing significant ones and their use in SE. The poster also presents a mapping of key SE topics and their proposed LTs while emphasizing the role of context in using LTs. The poster further presents teaching Software Product Lines as an illustrative example. Finally, future work of this poster includes designing modeling languages to represent LTs and mapping them to topics in SWEBOK and GSwERC (software engineering curriculum). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AICCSA 2011 program schedule

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | PDF file iconPDF (88 KB)  
    Freely Available from IEEE
  • Economic grid fault tolerance scheduling using modified Genetic Algorithm

    Page(s): 1 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (289 KB) |  | HTML iconHTML  

    Computational grids allow the sharing of geographically distributed resources in an efficient way, extending the boundaries of what we perceive as distributed computing. It is a fact that the computational grid nodes are not 100% secure from failure. Here comes a problem on how to handle failing nodes and effectively schedule and distribute the required work on the participating nodes and, in the same time, provide assurance that the task will be completed successfully. Additionally, when applying a recovery technique to an Economic Grid, the problem of maintaining the cost arises. In this paper, we propose an enhancement to a fault tolerance Genetic Algorithm (GA) using a checkpoint recovery technique. The enhancement focuses on finding a schedule which tries to minimize the running costs resulting from the overhead of implementing fault tolerance technique and in the same time tries to satisfy the quality constraints of the user. The results show that without adding these factors, the schedule running costs may be uncontrollable from the point of view of the grid owner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-centric Cloud management

    Page(s): 9 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (487 KB) |  | HTML iconHTML  

    In recent years most of the cloud computing community adopt an infrastructure centric approach to optimize the cost of cloud resources considering both Cloud Computing Service Users(CCSU) and Cloud Computing Service Providers(CCSP). In this paper we have brought up the concept of Application-centric Cloud. With Application-centric Cloud we propose an architecture to provide a generalized framework for auto deploying, sharing, providing scalability, robustness and availability of any cloud based application. Along with application independence, the framework also considers CCSP independence so that an application can use resources across providers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of parallel programming models and CPUs clock frequency on energy consumption of HPC systems

    Page(s): 16 - 21
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    Energy consumption has become one of the greatest challenges in the field of high performance computing (HPC). The energy cost produced by supercomputers during the lifetime of the installation is similar to acquisition. Thus, besides its impact on the environment, energy is a limiting factor for the HPC. Our research aims to reduce the energy consumption of computer systems to run parallel HPC applications. In this article we analyse the possible influence on the energy consumption of parallel programming paradigms of shared memory (OpenMP) and message passing (MPI), and the behaviour of systems at different clock frequencies of CPUs. The results show that the programming model has a major impact on the energy consumption of computer systems. It was found that the impact of reduced clock frequencies on the execution time, energy efficiency, and maximum power consumption depends not only on the type of application but also on its implementation in a specific programming model. We believe that another criteria to consider when choosing a parallel programming model is the impact on energy consumption. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastically robust static resource allocation for energy minimization with a makespan constraint in a heterogeneous computing environment

    Page(s): 22 - 31
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (369 KB) |  | HTML iconHTML  

    In a heterogeneous environment, uncertainty in system parameters may cause performance features to degrade considerably. It then becomes necessary to design a system that is robust. Robustness can be defined as the degree to which a system can function in the presence of inputs different from those assumed. In this research, we focus on the design of robust static resource allocation heuristics suitable for a heterogeneous compute cluster that minimize the energy required to complete a given workload. In this study, we mathematically model and simulate a heterogeneous computing system that is assumed part of a larger warehouse scale computing environment. Task execution times/energy consumption may vary significantly across different data sets in our heterogeneous cluster; therefore, the execution time of each task on each node is modeled as a random variable. A resource allocation is considered robust if the probability that all tasks complete by a system deadline is at least 90%. To minimize the energy consumption of a specific resource allocation, dynamic voltage frequency scaling (DVFS) is employed. However, other factors, such as system overhead (spent on fans, disks, memory, etc.) must also be mathematically modeled when considering minimization of energy consumption. In this research, we propose three different heuristics that employ DVFS to minimize energy consumed by a set of tasks in our heterogeneous computing system. Finally, a lower bound on energy consumption is provided to gauge the performance of our heuristics. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliable peer-to-peer protocol for mobile Ad-Hoc wireless networks

    Page(s): 32 - 37
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (210 KB) |  | HTML iconHTML  

    Reliable, fast, and power aware communication is needed for Ad-Hoc wireless networks. Current techniques based on client-server and Publish/Subscribe communication models are not suitable in multi-robot systems and generally for mobile applications. For this we propose a reliable peer-to-peer protocol based on a UDP Broadcast and Token Passing (UBTP). The protocol is implemented on a WLAN using the Stargate embedded system. For this, a customized UDP protocol with an imperative Poll-based communication is proposed. The protocol is implemented using (1) a communication thread (TC) and (2) a processing thread (TP). A test bed system which allows modules to run TC and TP, in addition to the generation of broadcast request is presented. We used symmetric code in each node. Evaluation reports the distribution of auction completion times for peer-to-peer operations. The evaluation reveals: (1) response times are comparable to UBTP operated at head node, (2) improved degree of reliability as at most 2 steps are sufficient for auctioning seven nodes, (3) proved fairness, and (4) comparable power consumption to simple UBTP. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Defending against energy efficient link layer jamming denial of service attack in wireless sensor networks

    Page(s): 38 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (562 KB) |  | HTML iconHTML  

    Wireless Sensor Networks (WSNs) are vulnerable to attacks due to their limited software and hardware capabilities. Energy efficient link layer jamming attacks have proven to be a real threat to wireless sensor networks. This type of attacks is able to prevent network communication for relatively long periods as it does not spend a lot of power while jamming. This paper proposes and evaluates two modifications to the Lightweight Medium Access Control (LMAC) [3] protocol. The first is Data Packet Separation Slot Size Randomization (DS-SSR); the second is Round Robin (RR) slot size assignment. The paper shows that (DS-SSR) can increase the WSN resistance against the Energy efficient denial of service link layer jamming attacks. The paper also shows that employing RR slightly eliminates the negative impact on the network throughput when using countermeasures against energy efficient jamming. Two measures are used to evaluate the resistance of the proposed protocol against the attack: lifetime advantage and censorship rate. Experimental results show that about 8% reduction of the attacker lifetime advantage can be achieved with DS-SSR LMAC compared to other countermeasure. Furthermore, results show that the censorship rate of our proposed protocol was similar to the other countermeasures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable distributed data fusion scheme in unsafe sensor networks

    Page(s): 46 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (412 KB) |  | HTML iconHTML  

    In this paper, we deal with the problem of distributed data fusion in unsafe large-scale sensor networks. Data fusion application is the phase of processing the collected data by sensor nodes before sending it the end user. During this phase, resource failures are more likely to occur and can have an adverse effect on the application. To achieve/ensure the convergence of node states to the average of the initial measurements of the network even when sensor nodes are subject to failures, two algorithms are presented. We introduce first an efficient fault-tolerant scheme capable of supporting faults due to battery depletion. Next, we derive a more complex solution to resist to frequent and unexpected fail-silent/fail-stop node failures. We provide a comprehensive set of experimental results, that fully demonstrate the usefulness of the proposed schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MSR: A multipath secure reliable routing protocol for WSNs

    Page(s): 54 - 59
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (226 KB) |  | HTML iconHTML  

    Many routing protocols have been proposed for wireless sensor networks (WSNs). However, only few of them addressed secure routing. This work contributes in solving secure and reliable routing problems by presenting a secure and reliable multipath routing protocol (MSR) for WSNs. MSR consists of three key components: on-demand multipath routing, enhanced passive acknowledgment, and erasure coding. On-demand routing enhances the security and reliability of the routing protocol while enhanced passive acknowledgment is used to both enhance the security of the protocol and reduce its overhead. In addition, erasure coding is further used to increase the protocol security and reliability. We present the details of the protocol along with a study of major security attacks in WSNs and determines the level of MSR's resistance against these attacks. The evaluation of the proposed protocol using the NS2 simulator shows that it can significantly enhance the security of WSNs under different attacker models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.