Security Issues of Virtualization Techniques & Challenges in the Cloud Computing Environments

Cloud computing environment is a modern that is relating the present time  developing and based on the current news information Technology methods that is increase application quality that obsolete be developed  and to make better changesin terms of functioning, and able to an original resource management and collaborative execution approach. In the middle of part of cloud computing is virtualization which enables industry or products using machines or academic Information Technology resources into one side other side on demand allocation are always or changing energy or emotion. The resources having not the same kinds forms such as network, virtualization, server, storage capacity, application and client.  This article attention is focused as on how virtualization helps to improve and upgrade adaptable of the resources in cloud computing environment.  The act or processing of joining to, this paper gives particular facts and the review of source virtualization techniques, challenges and future research direction and instructions

Markov Models of Telephone Speech Dialogues

Analogue speech signals are the most natural form of communication among humans. The contemporary methods adopted for the analysis of voice transmission by packet switching were designed mainly with respect to a Poisson stream of input packets, for which the probability of an active packet on each input port of the router is a constant value in time. An assumption that is not always valid, since the formation of speech packets during a dialogue is a non-stationary process, in which case mathematical modeling becomes an effective method of analysis, through which necessary estimates of a network node being designed for packet transmission of speech may be obtained. This paper presents the result of analysis of mathematical models of Markov chain based speech packet sources vis-à-vis the peculiarities of telephone dialogue models. The derived models can be employed in the design and development of methods of statistical multiplexing of packet switching network nodes

Markov Models of Statistical Multiplexing of Telephone Dialogue with Packet Switching

Existing methods of analysis of voice transmission by packet switching were designed mainly with respect to a Poisson stream of input packets, for which the probability of an active packet on each input port of the router is a constant value in time. This assumption is not always valid, since the formation of speech packets during a dialogue is a nonstationary process, in which case mathematical modeling becomes an effective method of analysis, through which necessary estimates of a network node being designed for packet transmission of speech may be obtained. This paper presents the result of analysis of mathematical models of Markov chain based speech packet sources vis-à-vis the peculiarities of telephone dialogue models. The derived models can be employed in the design and development of methods of statistical multiplexing of packet switching network nodes

Polish grid infrastructure for science and research

Structure, functionality, parameters and organization of the computing Grid in Poland is described, mainly from the perspective of high-energy particle physics community, currently its largest consumer and developer. It represents distributed Tier-2 in the worldwide Grid infrastructure. It also provides services and resources for data-intensive applications in other sciences.Comment: Proceeedings of IEEE Eurocon 2007, Warsaw, Poland, 9-12 Sep. 2007, p.44

Late allocation and early release of physical registers

The register file is one of the critical components of current processors in terms of access time and power consumption. Among other things, the potential to exploit instruction-level parallelism is closely related to the size and number of ports of the register file. In conventional register renaming schemes, both register allocation and releasing are conservatively done, the former at the rename stage, before registers are loaded with values, and the latter at the commit stage of the instruction redefining the same register, once registers are not used any more. We introduce VP-LAER, a renaming scheme that allocates registers later and releases them earlier than conventional schemes. Specifically, physical registers are allocated at the end of the execution stage and released as soon as the processor realizes that there will be no further use of them. VP-LAER enhances register utilization, that is, the fraction of allocated registers having a value to be read in the future. Detailed cycle-level simulations show either a significant speedup for a given register file size or a reduction in the register file size for a given performance level, especially for floating-point codes, where the register file pressure is usually high.Peer ReviewedPostprint (published version

On the metaphysics of management

The question about the metaphysics of management is considered especially from the point of view of the subject, acts and object of management. Management is understood holistically, in connection to production, rather than as an independent domain in itself. In terms of metaphysics, the time-honoured question about the superiority of thing (substance, matter) ontology or process ontology is addressed. The determination of metaphysical commitments is discussed. Empirical evidence on the appropriateness of alternative metaphysical assumptions inmanagement is forwarded. It is concluded that Western management thinking has been dominated by thing metaphysics. This has led to deficient conceptualizations and counterproductive methods, present in the 20th century. There have been process metaphysics based correctives, which include Japanese-originated methods and out-of-the box methods developed by Western parties. These correctives have often outperformed their substance based counterparts, but their adoption in the West has been slow. It is concluded that the Western metaphysical assumptions, especially when implicit, hinder learning, understanding and implementation of the process based correctives in the realm of management. However, even if the dominant Western metaphysics constrains our thinking, it might be possible to break out of it, through appropriate ontology training

KISS-Tree: Smart Latch-Free In-Memory Indexing on Modern Architectures

Growing main memory capacities and an increasing number of hardware threads in modern server systems led to fundamental changes in database architectures. Most importantly, query processing is nowadays performed on data that is often completely stored in main memory. Despite of a high main memory scan performance, index structures are still important components, but they have to be designed from scratch to cope with the specific characteristics of main memory and to exploit the high degree of parallelism. Current research mainly focused on adapting block-optimized B+-Trees, but these data structures were designed for secondary memory and involve comprehensive structural maintenance for updates. In this paper, we present the KISS-Tree, a latch-free inmemory index that is optimized for a minimum number of memory accesses and a high number of concurrent updates. More specifically, we aim for the same performance as modern hash-based algorithms but keeping the order-preserving nature of trees. We achieve this by using a prefix tree that incorporates virtual memory management functionality and compression schemes. In our experiments, we evaluate the KISS-Tree on different workloads and hardware platforms and compare the results to existing in-memory indexes. The KISS-Tree offers the highest reported read performance on current architectures, a balanced read/write performance, and has a low memory footprint