Filters








23,071 Hits in 2.5 sec

Distributed computing column 54 transactional memory: models and algorithms

Jennifer L. Welch
2014 ACM SIGACT News  
This issue's column consists of a review article by Gokarna Sharma and Costas Busch on models and algorithms for transactional memory (TM), with particular emphasis on scheduling.  ...  First, work on transaction scheduling algorithms for tightly-coupled systems are surveyed.  ...  We compared the performance of MultiBend with existing algorithms Arrow [25] and Ballistic [46] .  ... 
doi:10.1145/2636805.2636823 fatcat:xnjbxycmfbfkdop6eyzrbbj4nq

Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption

Xin-rui Tao, Jun-qing Li, Ti-hao Huang, Peng Duan
2020 Complex & Intelligent Systems  
To address this issue, a discrete imperialist competitive algorithm (DICA) was proposed to minimize the makespan and energy consumption.  ...  Then, a decoding method considering the resource allocation was designed. Finally, we combined DICA and the simulated annealing algorithm (SA) to improve the performance of the proposed approach.  ...  Each algorithm was run 30 times on the same computer considering 20 test cases. The comparative experimental results are presented in Tables 10, 11, and 12.  ... 
doi:10.1007/s40747-020-00193-w fatcat:lklqr6zygzd6hmitw4naercvgm

Page 1239 of The Journal of the Operational Research Society Vol. 59, Issue 9 [page]

2008 The Journal of the Operational Research Society  
of a bot- tleneck in the distribution resources of the supply chain.  ...  Computational results evaluate the efficiency of the algorithmic developments proposed in this paper, and attest the quality and robustness of the solution method.  ... 

Reusable software components

Trudy Levine
2012 ACM SIGAda Ada Letters  
Sponsored by the Ada Resource Assoc.  ...  applications following the Ada Distributed Systems Annex standards, and PolyORB to develop distributed applications following the CORBA standard.  ...  Skein is a cryptographic hash function and an entrant in the National Institute of Standards and Technology (NIST) hash function competition to design what will become the new Secure Hash Algorithm (SHA  ... 
doi:10.1145/2148436.2148452 fatcat:kcxxz6y7lrau7l5kijtyo2c7j4

Cognitive MIMO radio

Gesualdo Scutari, Daniel P. Palomar, Sergio Barbarossa
2008 IEEE Signal Processing Magazine  
Cognitive MIMO Radio: A Competitive Optimality Design Based on Subspace Projections  ...  ., [20] - [23] , the algorithms are not suitable for CR systems as they are centralized and thus cannot be implemented in a distributed way.  ...  Moreover all the algorithms obtained from Algorithm 1 have the following desired properties: ■ Low complexity and distributed nature: Even in the presence of null and/or shaping constraints, the best response  ... 
doi:10.1109/msp.2008.929297 fatcat:2jz2x6ixdbgm7fb5bya2z4l2yy

Efficient Resource Allocation via Efficiency Bootstraps: An Application to R&D Project Budgeting

Chien-Ming Chen, Joe Zhu
2011 Operations Research  
First, traditional DEA models compute efficiency scores by optimizing firm-specific shadow prices of inputs and outputs.  ...  Resource allocation decisions are crucial for the success of an organization.  ...  Fine (2000) further describes a firm's core competitive advantage as the ability to judiciously organize its resources in the value chain.  ... 
doi:10.1287/opre.1110.0920 fatcat:cdy3xp3ljbc47bmnzi6nsodkx4

An improved algorithm for online rectangle filling

Rob van Stee
2012 Theoretical Computer Science  
We give an online algorithm with competitive ratio 1.753 for this problem, improving over the previous upper bound of 1.848.  ...  We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot.  ...  We next compute the expected optimal profit.  ... 
doi:10.1016/j.tcs.2011.12.067 fatcat:czlrpa7uwzar7bhmm64n2rh77i

Color Image Encryption Using Angular Graph Fourier Transform

Liuqing Yang, Wei Meng, Xudong Zhao
2021 International Journal of Digital Crime and Forensics  
The experimental results demonstrate that the proposed algorithm can resist various potential attacks and achieve better performance than the state-of-the-art algorithms.  ...  While histograms of other competitive methods still have a unique distribution for each image, the histograms of the encrypted images using proposed AGFT differ from the original ones, and all distribute  ...  For example, lots of resources are consumed for data transmission rather than computation. Furthermore, extending the proposed AGFT for high-dimensional data also requires more research.  ... 
doi:10.4018/ijdcf.20210501.oa5 fatcat:y7cuvhzd2va2vd7fg53e5emiwu

Solving Practical Railway Crew Scheduling Problems with Attendance Rates

Kirsten Hoffmann, Udo Buscher, Janis Sebastian Neufeld, Felix Tamke
2017 Business & Information Systems Engineering  
A hybrid column generation approach is applied, which solves the pricing problem by means of a genetic algorithm.  ...  The distribution of computation time among the different stages of the algorithm is similar for all solved instances and is exemplified for Network III in Table 4 .  ...  Hence, the maximum total computation time for the proposed algorithm was about 9 h (32,400 s).  ... 
doi:10.1007/s12599-017-0470-8 fatcat:6ehskoekbjcedll565unksxxum

Multiprotocol Label Switching [chapter]

2012 Advanced Internet Protocols, Services, and Applications  
It is a distributed database that holds this mapping information (as well as various other types of technical information regarding computers on the Internet) in resource records.  ...  In this case, a label distribution protocol could make use of a separate route selection protocol, such as an enhanced OSPF, or incorporate a routing algorithm into a more complex label distribution protocol  ...  This publication is distributed on an "as-is" basis, without warranty of any kind either express or implied, including but not limited to the implied warranties of merchantability, fitness for a particular  ... 
doi:10.1002/9781118180822.ch5 fatcat:n6ienh6vtzhgjk7ye72rgkegai

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
However, both problems could be solved efficiently on a large enough quantum computer.  ...  While quantum computers powerful enough to break currently used parameter sets are not available yet, they are heavily researched and expected to reach maturity in 15 to 20 years.  ...  column.  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y

Density-Based LLE Algorithm for Network Forensics Data

Tao Peng, Xiaosu Chen, Huiyu Liu, Kai Chen
2011 International Journal of Modern Education and Computer Science  
Algorithms for this task are based on the idea that the dimensionality of many data sets is only artificially high.  ...  To analyze logs, the system must keep information regarding all the actions performed, which invariably results in huge amounts of data, requiring disk space and CPU resources.  ...  Copyright © 2011 MECS I.J.Modern Education and Computer Science, 2011, 1,52-59 2. Compute the weights W ij that best reconstruct Xi from its neighbors.  ... 
doi:10.5815/ijmecs.2011.01.08 fatcat:2diwnjsemrhx7bytgkaoekuzni

Toward nature-inspired computing

Jiming Liu, K.C. Tsui
2006 Communications of the ACM  
Distributed.  ...  One interesting issue in studying the emergent behaviors that leads to some The Environment An Autonomous Entity Local behavioral rules desired computing solutions (such as optimal resource allocation  ...  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage  ... 
doi:10.1145/1164394.1164395 fatcat:y2cspzxqojgyfp5faexk47obgq

Apache Spark

Matei Zaharia, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, Ion Stoica, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng (+2 others)
2016 Communications of the ACM  
THE GROWTH OF data volumes in industry and research poses tremendous opportunities, as well as tremendous computational challenges.  ...  As data sizes have outpaced the capabilities of single machines, users have needed new systems to scale out computations to multiple nodes.  ...  In applications with more computation (such as the ALS algorithm) distributing the application on Spark still helps. code to run directly against this layout.  ... 
doi:10.1145/2934664 fatcat:zqffhrnl4rhk5ayrdyv25aiyeq

Distinguishing Two Probability Ensembles with One Sample from each Ensemble

Luís Antunes, Harry Buhrman, Armando Matos, André Souto, Andreia Teixeira
2015 Theory of Computing Systems  
Choose a random column j , where j is uniformly distributed over {1, · · · , 6m}, and communicate (j, b 1 , b 2 , · · · , b 6m ) to C , where (b 1 , b 2 , · · · , b 6m ) is the content of column j .  ...  The proof is insensitive to the number of input samples and also to the class of time and space resources allowed in the distinguishing algorithms, and somewhat insensitive to the (positive) probabilities  ... 
doi:10.1007/s00224-015-9661-1 fatcat:n5rno2g3nfe55nat2wtuyeglom
« Previous Showing results 1 — 15 out of 23,071 results