Filters








3,770 Hits in 11.1 sec

Erbium

Cupertino Miranda, Antoniu Pop, Philippe Dumont, Albert Cohen, Marc Duranton
2010 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems - CASES '10  
and dynamic task invocation at coarser grain.  ...  Furthermore, although it advocates for streaming communications, it still relies on dynamic scheduling for event-driven synchronization.  ... 
doi:10.1145/1878921.1878924 dblp:conf/cases/MirandaPDCD10 fatcat:3wh77qldr5eorbelradm6h7ci4

Determinating timing channels in compute clouds

Amittai Aviram, Sen Hu, Bryan Ford, Ramakrishna Gummadi
2010 Proceedings of the 2010 ACM workshop on Cloud computing security workshop - CCSW '10  
The OS supports deterministic versions of familiar APIs such as processes, threads, shared memory, and file systems, and runs coarse-grained parallel tasks as efficiently and scalably as current timing  ...  Experiments with a prototype OS for deterministic cloud computing suggest that such an approach may be practical and efficient.  ...  Recent application-level deterministic scheduling techniques show promise [5, 6] , but they apply only within a process and do not prevent a guest from intentionally escaping its "deterministic sandbox  ... 
doi:10.1145/1866835.1866854 dblp:conf/ccs/AviramHFG10 fatcat:lj2mgyft4vhjroms3f5vfbfu4m

The Concept of an Autonomic Avionics Platform and the Resulting Software Engineering Challenges [article]

Bjoern Annighoefer, Johannes Reinhart, Matthias Brunner, Bernd Schulz
2021 arXiv   pre-print
The rigid certification process and the requirements for a static and predetermined system behavior are, however, in contradiction with the adaptive and flexible nature of autonomic computing systems.  ...  The core is a platform consciousness based on a domain-specific model and a novel MAP-QE-K cycle.  ...  ACKNOWLEDGMENT This paper is based on the PAFA-ONE project (contract: 20E1921) funded by the German Federal Ministry of Economic Affairs and Energy (BMWI) in the LuFo VI-1 program. Preprint  ... 
arXiv:2103.12065v1 fatcat:6uv5pmxqojhlpfyii53q4irzra

The Optimal Employment of Supply Chain management Decision Support Agents: an Exploratory Study

Angela Mattia
2010 Americas Conference on Information Systems  
The study discusses the sorts of supply-related managerial tasks that decision support agents have been assigned, and how well or poorly they have performed these tasks.  ...  The issue of interest here is the employment of decision support agents in supply chain management.  ...  The resource agent merges the functions of inventory management and purchasing. It dynamically manages the availability of resources so that the schedule can be executed. • Dispatching agent.  ... 
dblp:conf/amcis/Mattia10 fatcat:mnfh2bi77vdbxcsmf6mwfkb5te

Scheduler-conscious synchronization

Leonidas I. Kontothanassis, Robert W. Wisniewski, Michael L. Scott
1997 ACM Transactions on Computer Systems  
We find that while it is possible to avoid pathological performance problems using previously proposed kernel mechanisms, a modest additional widening of the kernel/user interface can make scheduler-conscious  ...  synchronization algorithms significantly simpler and faster, with performance on dedicated machines comparable to that of scheduler-oblivious algorithms.  ...  Thanks also to Donna Bergmark and the Cornell Theory Center for their help with the KSR 1, to Maged Michael and the anonymous referees for their careful reading and helpful suggestions, and to Ken Birman  ... 
doi:10.1145/244764.244765 fatcat:dggjnw6zxfgvtj43stqeh76vpq

Energy-Conscious Co-scheduling of Tasks and Packets in Wireless Real-Time Environments

Jun Yi, Christian Poellabauer, Xiaobo Sharon Hu, Jeff Simmer, Liqiang Zhang
2009 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium  
., as provided by bandwidth-reservation mechanisms, limits contention and therefore is capable of providing effective real-time support to periodic communications.  ...  However, packet schedulers must be aware of the limited communication opportunities to ensure that packets are transmitted before their deadlines, CPU schedulers must execute jobs such that the packets  ...  For example, CSMA is simple, robust, and scalable, but also non-deterministic and thus incapable of providing effective QoS support to periodic communications often found in wireless real-time systems.  ... 
doi:10.1109/rtas.2009.35 dblp:conf/rtas/YiPHSZ09 fatcat:jsdikpx7qzdz3j3cyskbbrlc6i

Effective Load Balancing in Cloud Computing

Zeinab Goudarzi
2014 International Journal of Intelligent Information Systems  
Given the importance of the process of load balancing in Cloud Computing, the aim of this paper is to review the process and to compare techniques in this field.  ...  One of the latest changes in the functionality of the Internet has been the introduction of Cloud Computing.  ...  Until all tasks are scheduled the same procedure is repeated [19] . Max-Min This algorithm is almost same as the Min-Min algorithm but, it schedules larger tasks first of all i.e.  ... 
doi:10.11648/j.ijiis.s.2014030601.11 fatcat:rz5xe565qzeupaviuch5wjer34

Contention-conscious transaction ordering in multiprocessor DSP systems

M. Khandelia, N.K. Bambha, S.S. Bhattacharyya
2006 IEEE Transactions on Signal Processing  
This paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow graphs.  ...  BACKGROUND T HIS paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow specifications.  ...  Note the labeling of the IPC tasks (shaded)-s(i; j) represents a send from computational task i to computational task j while r(i; j ) represents a receive from computational task i to computational task  ... 
doi:10.1109/tsp.2005.861074 fatcat:ypvrzyck3vcyle3h2qde3gka7a

Integer linear programming and heuristic techniques for system-level low power scheduling on multiprocessor architectures under throughput constraints

Krishnan Srinivasan, Karam S. Chatha
2007 Integration  
joint scheduling of periodic task graphs and aperiodic tasks in distributed real-time embedded systems, ]), respectively.  ...  The proposed techniques are compared with two existing strategies that apply (i) loop pipelining (FP) with DPM but no DVS, and (ii) DVS and DPM but no loop transformations (LPS [Luo, Jha, Power conscious  ...  Acknowledgement The research presented in this paper was supported in part by a grant from the National Science Foundation (CNS-0509540) and Consortium of Embedded Systems.  ... 
doi:10.1016/j.vlsi.2006.01.001 fatcat:eytdfkrqmfetnbygh63dcqfdw4

An energy-efficient real-time scheduling scheme on dual-channel networks

Mikyung Kang, Dong-In Kang, Jinwoo Suh, Junghoon Lee
2008 Information Sciences  
The proposed scheme is based on a dynamic modulation scaling scheme which can scale the number of bits per symbol and a switching scheme which can swap the polling schedule between channels.  ...  The recent evolution of wireless sensor networks have yielded a demand to improve energy-efficient scheduling algorithms and energy-efficient medium access protocols.  ...  them has the same period and communication time but the number of BPS is reduced.  ... 
doi:10.1016/j.ins.2008.02.007 fatcat:vnhhmvhwobb2jpbh2jvsxnvgdu

A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine [article]

Lenore Blum, Manuel Blum
2022 arXiv   pre-print
We are not looking for a complex model of the brain nor of cognition, but for a simple computational model of (the admittedly complex concept of) consciousness.  ...  We do this by defining the Conscious Turing Machine (CTM), also called a conscious AI, and then we define consciousness and related notions in the CTM.  ...  to simulate CTM (Villecroze, Personal Communication), (Villecroze, 2019) .  ... 
arXiv:2107.13704v10 fatcat:xbapd6m6r5c57esanewyvpbgj4

Intertemporal Production Frontiers: With Dynamic DEA

R Färe, S Grosskopf
1997 Journal of the Operational Research Society  
This book deals with deterministic machine scheduling problems, but the authors are quick to stress that this does not rule out dynamic problems (problems in which ready times are unknown in advance).  ...  The classi®cation of deterministic scheduling problems and the motivation for studying them is given in Chapter 3.  ... 
doi:10.1057/palgrave.jors.2600779 fatcat:6du5wz3hbzeirieate7hfra3si

A taxonomy and survey on autonomic management of applications in grid computing environments

Mustafizur Rahman, Rajiv Ranjan, Rajkumar Buyya, Boualem Benatallah
2011 Concurrency and Computation  
The taxonomy not only highlights the similarities and differences of state-of-the-art technologies utilized in autonomic application management from the perspective of Grid computing, but also identifies  ...  for decentralized and deterministic resource discovery and monitoring.  ...  The dynamic scheduling approach proactively monitors the status of the Grid resources and schedules tasks according to the current condition of the computational environment by dynamic policies such as  ... 
doi:10.1002/cpe.1734 fatcat:rgaqyybmmvdufphqfcr47ymhoe

A Theoretical Computer Science Perspective on Consciousness [article]

Manuel Blum, Lenore Blum
2021 arXiv   pre-print
This paper studies consciousness from the perspective of theoretical computer science.  ...  We are not looking for a complex model of the brain nor of cognition but for a simple model of (the admittedly complex concept of) consciousness.  ...  painstaking multiple reviews of this paper, his pointers to the literature, and his ongoing work to simulate CTM (Villecroze J.  ... 
arXiv:2011.09850v4 fatcat:jrx2cryfb5eyvbe4o6bemb7beq

How to Safely Integrate Multiple Applications on Embedded Many-Core Systems by Applying the "Correctness by Construction" Principle

Robert Hilbrich
2012 Advances in Software Engineering  
The integration of multiple and potentially parallel functions on a chip—instead of just a single function—makes best use of the resources offered.  ...  However, this multifunction approach leads to new technical and nontechnical challenges during the integration.  ...  Dynamic scheduling algorithms at run-time focus on assigning priorities to tasks, so that the most important task is selected for execution by a dispatcher component.  ... 
doi:10.1155/2012/354274 fatcat:tycdbj3uf5dtbliimvrkuf3cwm
« Previous Showing results 1 — 15 out of 3,770 results