Kooperativer Bibliotheksverbund

Berlin Brandenburg

and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • SpringerLink Books - All  (9)
  • 1
    Language: English
    In: Lecture Notes in Computer Science, Data Management in Grid and Peer-to-Peer Systems: 4th International Conference, Globe 2011, Toulouse, France, September 1-2, 2011, Proceedings, pp.73-82
    Description: Request forwarding is an efficient approach in discovering resources in distributed systems because it achieves one of the main goals of distributed systems namely the scalability goal. Despite achieving reasonable scalability, this approach suffers from long response times to resource requests. Several solutions such as learning-based request forwarding have tried to improve the response time but not quite. This is because target nodes in learning-based request forwarding are selected based on their responses to previous similar requests. This method of selection overloads the nodes and prolongs the response times to resource requests. This paper introduces a new strategy for selection of target nodes to ameliorate this flaw by taking into account the loads on target nodes as well as their abilities in responding to requests based on their previous behaviors. Evaluations show that as the number of requests increases, the proposed strategy reduces the response times to resource requests much more significantly compared with pure learning-based request forwarding strategy.
    Keywords: Computer Science ; Computing Methodologies ; Database Management ; Software Engineering ; Information Systems Applications (Incl.Internet) ; Artificial Intelligence (Incl. Robotics) ; Management of Computing and Information Systems ; Engineering ; Computer Science
    ISBN: 9783642229466
    ISBN: 3642229468
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: Communications in Computer and Information Science, High Performance Architecture and Grid Computing: International Conference, HPAGC 2011, Chandigarh, India, July 19-20, 2011. Proceedings, pp.322-326
    Description: The majority of existing OpenMP compilers select the maximum number of available processing cores on a multi-core machine at runtime to execute a parallelized program on that machine. In this paper, we show that the use of maximum number of available cores does not necessarily result in speedup or efficiency. We show that in a considerable number of cases the use of more cores results in diminishing returns on execution time and efficiency. To help in choosing the proper number of cores, we propose an analytical method to estimate the execution times of OpenMP programs using different numbers of cores while considering the synchronization, excess computation and load imbalance overheads caused by the chosen number of cores. We validate our proposed method through a case study covering most recurrent and important structures and constructs of OpenMP.
    Keywords: Computer Science ; Computer Communication Networks ; Information Systems Applications (Incl.Internet) ; Artificial Intelligence (Incl. Robotics) ; Algorithm Analysis and Problem Complexity ; Software Engineering ; Information Storage and Retrieval ; Engineering ; Computer Science
    ISBN: 9783642225765
    ISBN: 3642225764
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Book chapter
    Book chapter
    Berlin, Heidelberg: Springer Berlin Heidelberg
    Language: English
    In: Lecture Notes in Computer Science, Parallel and Distributed Processing and Applications: 5th International Symposium, ISPA 2007 Niagara Falls, Canada, August 29-31, 2007 Proceedings, pp.719-727
    Description: A category of wireless sensor networks consists of lots of autonomous sensor nodes with limited power and few base stations with theoretically unlimited power. A number of redundant nodes are usually deployed densely in these types of networks in order to provide redundancy for sensing and communications. There is a challenge though of which nodes must be active and which ones must be asleep, without compromising the coverage and network connectivity. To get round this challenge, each node should somehow know the position of its immediate neighbors. Previous researches have impractically assumed the existence of a GPS module in each node, which is in direct contradiction with the main constraints of low cost and size of sensor nodes. This paper proposes an energy saving solution without requiring the nodes to possess any physical GPS. The goal is to minimize the number of active sensors with respect to coverage and connectivity. Each node decides locally by itself whether to be active or not. There is no need for any global synchronization between nodes. Simulation results show that the higher density of nodes in our proposed solution leads to better coverage, higher energy saving and longer network lifetime.
    Keywords: Computer Science ; Algorithm Analysis and Problem Complexity ; Computer Communication Networks ; Information Systems Applications (Incl.Internet) ; System Performance and Evaluation ; Software Engineering ; Operating Systems ; Computer Science
    ISBN: 9783540747413
    ISBN: 3540747419
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book chapter
    Book chapter
    Berlin, Heidelberg: Springer Berlin Heidelberg
    Language: English
    In: Lecture Notes in Computer Science, Reliable Software Technologies – Ada-Europe 2006: 11th Ada-Europe International Conference on Reliable Software Technologies, Porto, Portugal, June 5-9, 2006. Proceedings, pp.203-214
    Description: The CORBA standard adopted by OMG supports reliability using two orthogonal mechanisms: Replication (by means of FT-CORBA standard) and Transaction (with the aid of OTS standard). Replication represents a roll-forward approach in which a failed request is re-directed into another replica that is alive. On the other hand, transaction represents a roll-back approach in which a system reverts into its last committed state upon any failure. Current researches show that integrating these two approaches is essential in 3-tier systems, wherein the replication protects system processes from failures in the middle tier, and the transaction concept ensures the data consistency in the data tier. All proposed methods for reconciling these two concepts are unanimous that the transaction approach suffers from poor performance due to the use of two-phase commit protocol. In this paper we introduce a new replication-aware transaction model based on replicated objects. This kind of transaction can jump over the failures that the replicas come across without rolling the whole transaction back (we call it roll-over). Instead, the failed objects would be removed from the replica list and re-created somewhere else if needed. Implementation results of our model show better transaction throughput in comparison with known approaches.
    Keywords: Computer Science ; Software Engineering ; Programming Techniques ; Programming Languages, Compilers, Interpreters ; Computer Communication Networks ; Special Purpose and Application-Based Systems ; Management of Computing and Information Systems ; Computer Science
    ISBN: 9783540346630
    ISBN: 3540346635
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: Lecture Notes in Computer Science, Computational Science – ICCS 2006: 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part I, pp.981-984
    Description: The specific characteristics of Wireless Sensor Networks (WSNs) have changed Quality of Service (QoS) support in these networks to a challenging task. In this paper, we propose a dispatcher as part of a message routing component in publish/subscribe WSNs. Some works consider link-based solutions to support real-time parameters in WSNs. These works do not take into account the dynamic behavior of WSNs with probable damaged nodes and links. The use of dispatcher can reduce the average message delay, whether the message has high priority or low priority. The dispatcher uses a scheduler to support real-time parameters, such as delay, and selects messages from two separate queues, namely, QoS queue and non-QoS queue. Simulation results show that our approach really reduces the average delay and increases the delivery rate for both QoS messages and non-QoS messages.
    Keywords: Computer Science ; Theory of Computation ; Software Engineering/Programming and Operating Systems ; Numeric Computing ; Information Systems and Communication Service ; Computer Imaging, Vision, Pattern Recognition and Graphics ; Simulation and Modeling ; Computer Science
    ISBN: 9783540343790
    ISBN: 3540343792
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: Lecture Notes in Computer Science, Information Systems Security: Third International Conference, ICISS 2007, Delhi, India, December 16-20, 2007. Proceedings, pp.254-258
    Description: Phishing attack is a kind of identity theft trying to steal confidential data. Existing approaches against phishing attacks cannot prevent real-time phishing attacks. This paper proposes an Anti-Phishing Authentication (APA) technique to detect and prevent real-time phishing attacks. It uses 2-way authentication and zero-knowledge password proof. Users are recommended to customize their user interfaces and thus defend themselves against spoofing. The proposed technique assumes the preexistence of a shared secret key between any two communicating partners, and ignores the existence of any malware at client sides.
    Keywords: Computer Science ; Computer Communication Networks ; Data Encryption ; Systems and Data Security ; Computers and Society ; Management of Computing and Information Systems ; Information Storage and Retrieval ; Engineering ; Computer Science
    ISBN: 9783540770855
    ISBN: 3540770852
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Book chapter
    Book chapter
    Berlin, Heidelberg: Springer Berlin Heidelberg
    Language: English
    In: Communications in Computer and Information Science, Advances in Computer Science and Engineering: 13th International CSI Computer Conference, CSICC 2008 Kish Island, Iran, March 9-11, 2008 Revised Selected Papers, pp.769-772
    Description: Target tracking is one of the popular applications of wireless sensor networks wherein hundreds or thousands of randomly distributed sensor nodes in an environment gather spatio-temporal information from target(s) and send them to a sink node for further processing. Due to various environmental factors on sensor devices, this information is seldom very accurate. Sensor nodes partly process their sensed data using local fusion before sending them to the sink. This paper comparatively studies two major voting algorithms for fusion of target tracking data in intermediate nodes with a view on the accuracy of results. Majority voter and mean voter algorithms are simulated with different densities of sensor nodes to determine the best choice of sensor density for cost effective deployment of sensor nodes. It is shown that formal majority voter yields much more accurate and stable results in location tracking applications than mean voter.
    Keywords: Computer Science ; Computer Imaging, Vision, Pattern Recognition and Graphics ; Artificial Intelligence (Incl. Robotics) ; User Interfaces and Human Computer Interaction ; Information Systems Applications (Incl.Internet) ; Information Storage and Retrieval ; Information Systems and Communication Service ; Engineering ; Applied Sciences ; Computer Science
    ISBN: 9783540899846
    ISBN: 3540899847
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: Lecture Notes in Electrical Engineering, Trends in Intelligent Systems and Computer Engineering, pp.453-465
    Description: Due to the increasing gap between the speed of CPU and memory, cache designs have become an increasingly critical performance factor in microprocessor systems. Recent improvements in microprocessor technology have provided significant gains in processor speed. This dramatic rise has increased further the gap between the speed of the processor and main memory. Thus, it is necessary to design faster memory systems. In order to decrease the processor—memory speed gap, one of the main concerns has to be in the design of an effective memory hierarchy including multilevel cache and TLB (Translation Lookaside Buffer).The aim of this chapter is to offer a comprehensive and simulation-based performance evaluation of the cache and TLB design issues in embedded processors such as two-level versus single TLB, split versus unified cache, cache size, cache associativity, and replacement policy.The rest of chapter is organized as follows. Section 32.2 elaborates the problem under our study, related works on hierarchical TLB, specifications of SPEC CPU2000 benchmarks, and the reasons for selecting the benchmarks used in our study. Section 32.3 describes the setup of our experiments. Section 32.4 reports the results of our experiments, and Sect. 32.5 concludes the chapter.
    Keywords: Engineering ; Communications Engineering, Networks ; Computer Communication Networks ; Signal, Image and Speech Processing ; Artificial Intelligence (Incl. Robotics) ; Electronic and Computer Engineering ; Computer Systems Organization and Communication Networks ; Engineering ; Computer Science
    ISBN: 9780387749341
    ISBN: 0387749349
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Book chapter
    Book chapter
    Boston, MA: Springer US
    Language: English
    In: IFIP International Federation for Information Processing, Intelligent Information Processing III: IFIP TC12 International Conference on Intelligent Information Processing (IIP 2006), September 20–23, Adelaide, Australia, pp.101-110
    Description: The evolution of networks and the Internet, which have presented high scalable and available services have made environments more complex. The increasing complexity, cost, and heterogeny in distributed computing systems have motivated researchers to investigate a new idea to cope with the management of complexity in IT industry. For this, Autonomic Computing Systems (ACSs) have been introduced. In this paper, we present a complete survey of ACSs. It consists of characteristics, their effects on quality factors, architecture of ACS building blockes, and challenges.
    Keywords: Computer Science ; Artificial Intelligence (Incl. Robotics) ; Engineering ; Computer Science
    ISBN: 9780387446394
    ISBN: 0387446397
    Source: SpringerLink Books
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages