Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “data placement”
Mason, Samantha · Figshare · 2021
Placement data of camera traps deployed in a survey taking place in County Durham, UK. Part of dataset required for calculating mammal densities with camera trap distance sampling.<br>
Cited by 0Open access
Rajeev Balasubramonian · Synthesis lectures on computer architecture · 2019
Cited by 0
Samantha Mason · Figshare · 2021
Placement data of camera traps deployed in a survey taking place in County Durham, UK. Part of dataset required for calculating mammal densities with camera trap distance sampling.<br>
Cited by 0Open access
Patrick Valduriez · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
Cited by 0
Angela Renne, Shuhan He, Jarone Lee et al. · JAMA · 2022
scale and the NRS, we believe this demonstrates the validity of the emoji scale to assess pain perceptions. An important benefit of the emoji scale lies is its inherent Unicode encoding, which encompasses almost all the living languages of the world into a default 16-bit code for digital applications. For example, a loud crying face emoji corresponds to the Unicode character U+1F6D2, which can then be easily adapted into Unicode operating systems including electronic medical records or used in telehealth and mobile health technology. With the advent of the COVID-19 pandemic, the use of telehealth in medical practice has increased 38 times the pre-COVID-19 baseline level. We believe that emojis may have additional implications for digital patient communications due to the increasing use and scope of virtual and hybrid health care delivery models.
Cited by 0Open access
Patrick Valduriez · Encyclopedia of Database Systems · 2016
Cited by 0
Encyclopedia of Database Systems · 2009
Cited by 0
Pessano Serrat, Tatiana, Sebastian-Gonzalez, Esther, Orihuela-Torres, Adrian · Figshare · 2024
The role of vertebrate scavengers in the utilization of waterbirds hunting carcasses in a Mediterranean wetland
Cited by 0Open access
Brad Calder, Chandra Krintz, Simmi John et al. · 1998
As the gap between memory and processor speeds continues to widen, cache eficiency is an increasingly important component of processor performance. Compiler techniques have been used to improve instruction cache pet$ormance by mapping code with temporal locality to different cache blocks in the virtual address space eliminating cache conflicts. These code placement techniques can be applied directly to the problem of placing data for improved data cache pedormance.In this paper we present a general framework for Cache Conscious Data Placement. This is a compiler directed approach that creates an address placement for the stack (local variables), global variables, heap objects, and constants in order to reduce data cache misses. The placement of data objects is guided by a temporal relationship graph between objects generated via profiling. Our results show that profile driven data placement significantly reduces the data miss rate by 24% on average.
Cited by 266Open access
Mushtaq Hussain, Alhuseen Omar Alsayed, Md. Akhtarul Islam · Harvard Dataverse · 2021
In the first experiment of study , The student's first dataset used in the current study has been collected from the HARVARD repository []. The details are shown in Table 1 below. This dataset was collected from MBA students of CMS Business School in Jan 2020. This dataset contains placement data of students which include secondary and higher secondary school percentage and specialization and it also includes the type of and work experience and salary offer by the organization.
Cited by 0Open access
Lessani, Mohammad Naser, Deng,, Jiqiu, Guo, Zhiyong et al. · Figshare · 2022
Multiple geographical feature label placement (MGFLP) has been a fundamental problem in cartographic visualization over the decades. The nature of label placement is proven NP-hard, where the complexity of such a problem is directly influenced by the volume of input datasets.
Cited by 0Open access
M. Naser Lessani, Jiqiu Deng, Zhiyong Guo et al. · Figshare · 2022
Multiple geographical feature label placement (MGFLP) has been a fundamental problem in cartographic visualization over the decades. The nature of label placement is proven NP-hard, where the complexity of such a problem is directly influenced by the volume of input datasets.
Cited by 0Open access
Vasanth Bala, Jeanne Ferrante, Larry Carter · 1993
The ability to represent, manipulate and optimize data movement between devices such as processors in a distributed memory machine, or between global memory and processors in a shared memory machine, is crucial in generating efficient code for such machines. In this paper we describe a methodology for representing and manipulating data movement explicitly in a compiler. Our methodology, called Explicit Data Placement (XDP), consists of extensions to the compiler's intermediate program language, as well as run-time structures that allow certain operations to be performed efficiently. We also illustrate one of the unique features of the XDP methodology: the ability to manipulate the run-time transfer of data ownership between processors.
Cited by 5
Maogang Wang, Prithviraj Banerjee, Majid Sarrafzadeh · VLSI design · 1998
Traditional placement problems are studied under a fully specified cell library and a complete netlist. However, in the first, e.g. , 2 years of a 2 – 3 year microprocessor design cycle, the detailed netlist is unavailable. For area and performance estimation, layout must nevertheless be done with incomplete information. Another source of incompleteness comes from logic synthesis changes; some instances and their parameters will change as the project evolves. In the re‐configurable computing area, sometimes we need to perform quick placement before all information is available. The problem of placement with incomplete data (PID) can be abstracted as having to place a circuit when p c % of the cells and p n % of the nets are missing. The key challenge in PID is how to add missing cells and nets. In this paper, two “patching‐methods” for adding missing nets and cells are proposed. The methods are called abstraction and fusion . Experimental results are very interesting. First, they show that PID is a difficult problem and an arbitrary (and perhaps intuitively sound) method may not produce highquality results. Experiments verify that the abstraction method is a very good predictor and that fusion is not. Specifically, when a circuit has 10% incompleteness, abstraction can predict the final total wirelength with an error of 5.8% while fusion has a 67.8% error in predicting the wirelength in the same circuit.
Cited by 0Open access
Brad Calder, Chandra Krintz, Simmi John et al. · ACM SIGOPS Operating Systems Review · 1998
As the gap between memory and processor speeds continues to widen, cache eficiency is an increasingly important component of processor performance. Compiler techniques have been used to improve instruction cache pet$ormance by mapping code with temporal locality to different cache blocks in the virtual address space eliminating cache conflicts. These code placement techniques can be applied directly to the problem of placing data for improved data cache pedormance.In this paper we present a general framework for Cache Conscious Data Placement. This is a compiler directed approach that creates an address placement for the stack (local variables), global variables, heap objects, and constants in order to reduce data cache misses. The placement of data objects is guided by a temporal relationship graph between objects generated via profiling. Our results show that profile driven data placement significantly reduces the data miss rate by 24% on average.
Cited by 9Open access
Andreas Sembrant, Erik Hägersten, David Black-Schaffer · 2016
Modern processors employ multiple levels of caching to address bandwidth, latency and performance requirements. The behavior of these hierarchies is determined by their approach to data placement and data eviction. Recent research has developed many intelligent data eviction policies, but cache hierarchies remain primarily either exclusive or inclusive with regards to data placement. This means that today's cache hierarchies typically install accessed data into all cache levels at one point or another, regardless of whether the data is reused in each level. Such data movement wastes energy by installing data into cache levels where the data is not reused.
Cited by 6
Andrew H. MacPhail, Laurence S. Foster · Journal of Chemical Education · 1941
ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTNew data for placement proceduresAndrew H. MacPhail and Laurence S. Foster Cite this: J. Chem. Educ. 1941, 18, 5, 235Publication Date (Print):May 1, 1941Publication History Received3 August 2009Published online1 May 1941Published inissue 1 May 1941https://doi.org/10.1021/ed018p235RIGHTS & PERMISSIONSArticle Views29Altmetric-Citations2LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InReddit PDF (784 KB) Get e-Alerts Get e-Alerts
Cited by 3
Chidera Nwaroh (8259774), Adrianna Giuffre (8259777), Lauran Cole (8259780) et al. · Figshare · 2020
<p>Example of voxel placement in the sensorimotor cortex on a participant T1-weighted image. b) GABA-edited MEGA-PRESS spectra acquired in each location. The black line depicts the average fit line and the grey area shows ±1 standard deviation in the right and left sensorimotor cortex.</p>
Cited by 0Open access
Tarek Hamrouni, C. Hamdeni, Faouzi Ben Charrada · Multiagent and Grid Systems · 2015
The recent years have witnessed an explosive growth of data in many fields like scientific experiments and engineering applications. In this context, data grids have emerged as a useful technology for managing large amounts of distributed data. Data
Cited by 7
Jiangtao Li, Sunil Prabhakar · 2002
... object relationships into account. This work is in contrast to earlier schemes that either focus on specific data types or assume that data objects are accessed independently. Five new data placement schemes are developed. The effectiveness of these schemes is shown through simulation. The proposed schemes, in particular the Edge Merge scheme, give superior performance over schemes optimized for independent access. We also show
Cited by 0